Exact gate-sequences for universal quantum computation using the XY-interaction alone

Abstract

In a previous publication [1] we showed that it is possible to implement universal quantum computation with the anisotropic XY-Heisenberg exchange acting as a single interaction. To achieve this we used encodings of the states of the computation into a larger Hilbert space. This proof is non- constructive, however, and did not explicitly give the trade-offs in time that are required to implement encoded single qubit operations and encoded two-qubit gates. Here we explicitly give the gate-sequences needed to simulate these operations on encoded qubits and qutrits (three-level systems) and analyze the trade-offs involved. We also propose a possible layout for the qubits in a triangular arrangement.

6 pages, 5 figures

References in corpus (3)

• Reducing Constraints on Quantum Computer Design by Encoded Selective Recoupling
• Decoherence, Control, and Symmetry in Quantum Computers
• Quantum Computation with Coherent States, Linear Interactions and Superposed Resources

Cited by in corpus (28)

• A geometric theory of non-local two-qubit operations
• Controllable coherent population transfers in superconducting qubits for quantum computing
• Universal Quantum Computation through Control of Spin-Orbit Coupling
• Universal Leakage Elimination
• Overview of Quantum Error Prevention and Leakage Elimination
• Encoded Recoupling and Decoupling: An Alternative to Quantum Error Correcting Codes, Applied to Trapped Ion Quantum Computation
• Multi-qubit compensation sequences
• Extending matchgates into universal quantum computation
• Cloning transformations in spin networks without external control
• Theory of measurement crosstalk in superconducting phase qubits
• Effect of electron-nuclear spin interactions on electron-spin qubits localized in self-assembled quantum dots
• Encoded Universality for Generalized Anisotropic Exchange Hamiltonians
• Time Independent Universal Computing with Spin Chains: Quantum Plinko Machine
• Combined Error Correction Techniques for Quantum Computing Architectures
• Geometries for universal quantum computation with matchgates
• Compatible Transformations for a Qudit Decoherence-free/Noiseless Encoding
• Complexity classification of local Hamiltonian problems
• Tunable photon-mediated interactions between spin-1 systems
• Quantum computation from fermionic anyons on a 1D lattice
• Time independent quantum circuits with local interactions
• The computational power of matchgates and the XY interaction on arbitrary graphs
• Computational Complexity of Some Quantum Theories in $1+1$ Dimensions
• The Computational Complexity of Ball Permutations
• Encoded Universality of Quantum Computations on the Multi-Atomic Ensembles in the QED Cavity
• Pinned QMA: The power of fixing a few qubits in proofs
• Quantum Computing on Multi-atomic Ensembles in Quantum Electrodynamics Cavity
• The Computational Power of Non-interacting Particles
• Synthesis of Energy-Conserving Quantum Circuits with XY interaction