1,637 research outputs found

    Asymptotically Optimal Quantum Circuits for d-level Systems

    Full text link
    As a qubit is a two-level quantum system whose state space is spanned by |0>, |1>, so a qudit is a d-level quantum system whose state space is spanned by |0>,...,|d-1>. Quantum computation has stimulated much recent interest in algorithms factoring unitary evolutions of an n-qubit state space into component two-particle unitary evolutions. In the absence of symmetry, Shende, Markov and Bullock use Sard's theorem to prove that at least C 4^n two-qubit unitary evolutions are required, while Vartiainen, Moettoenen, and Salomaa (VMS) use the QR matrix factorization and Gray codes in an optimal order construction involving two-particle evolutions. In this work, we note that Sard's theorem demands C d^{2n} two-qudit unitary evolutions to construct a generic (symmetry-less) n-qudit evolution. However, the VMS result applied to virtual-qubits only recovers optimal order in the case that d is a power of two. We further construct a QR decomposition for d-multi-level quantum logics, proving a sharp asymptotic of Theta(d^{2n}) two-qudit gates and thus closing the complexity question for all d-level systems (d finite.) Gray codes are not required, and the optimal Theta(d^{2n}) asymptotic also applies to gate libraries where two-qudit interactions are restricted by a choice of certain architectures.Comment: 18 pages, 5 figures (very detailed.) MatLab files for factoring qudit unitary into gates in MATLAB directory of source arxiv format. v2: minor change

    Dark energy fingerprints in the nonminimal Wu-Yang wormhole structure

    Get PDF
    We discuss new exact solutions to nonminimally extended Einstein-Yang-Mills equations describing spherically symmetric static wormholes supported by the gauge field of the Wu-Yang type in a dark energy environment. We focus on the analysis of three types of exact solutions to the gravitational field equations. Solutions of the first type relate to the model, in which the dark energy is anisotropic, i.e., the radial and tangential pressures do not coincide. Solutions of the second type correspond to the isotropic pressure tensor; in particular, we discuss the exact solution, for which the dark energy is characterized by the equation of state for a string gas. Solutions of the third type describe the dark energy model with constant pressure and energy density. For the solutions of the third type, we consider in detail the problem of horizons and find constraints for the parameters of nonminimal coupling and for the constitutive parameters of the dark energy equation of state, which guarantee that the nonminimal wormholes are traversable.Comment: 11 pages, 2 figures, accepted for publication in Phys. Rev.

    Theory of Decoherence-Free Fault-Tolerant Universal Quantum Computation

    Get PDF
    Universal quantum computation on decoherence-free subspaces and subsystems (DFSs) is examined with particular emphasis on using only physically relevant interactions. A necessary and sufficient condition for the existence of decoherence-free (noiseless) subsystems in the Markovian regime is derived here for the first time. A stabilizer formalism for DFSs is then developed which allows for the explicit understanding of these in their dual role as quantum error correcting codes. Conditions for the existence of Hamiltonians whose induced evolution always preserves a DFS are derived within this stabilizer formalism. Two possible collective decoherence mechanisms arising from permutation symmetries of the system-bath coupling are examined within this framework. It is shown that in both cases universal quantum computation which always preserves the DFS (*natural fault-tolerant computation*) can be performed using only two-body interactions. This is in marked contrast to standard error correcting codes, where all known constructions using one or two-body interactions must leave the codespace during the on-time of the fault-tolerant gates. A further consequence of our universality construction is that a single exchange Hamiltonian can be used to perform universal quantum computation on an encoded space whose asymptotic coding efficiency is unity. The exchange Hamiltonian, which is naturally present in many quantum systems, is thus *asymptotically universal*.Comment: 40 pages (body: 30, appendices: 3, figures: 5, references: 2). Fixed problem with non-printing figures. New references added, minor typos correcte
    • …
    corecore