Scalable fault-tolerant quantum computation in DFS blocks

Abstract

We investigate how to concatenate different decoherence-free subspaces (DFSs) to realize scalable universal fault-tolerant quantum computation. Based on tunable $XXZ$ interactions, we present an architecture for scalable quantum computers which can fault-tolerantly perform universal quantum computation by manipulating only single type of parameter. By using the concept of interaction-free subspaces we eliminate the need to tune the couplings between logical qubits, which further reduces the technical difficulties for implementing quantum computation.

4 papges, 2 figures

References in corpus (12)

• Quantum state engineering with Josephson-junction devices
• Decoherence Free Subspaces for Quantum Computation
• Noiseless Quantum Codes
• A Theory of Quantum Error-Correcting Codes
• Preserving coherence in quantum computation by pairing quantum bits
• Theory of Decoherence-Free Fault-Tolerant Universal Quantum Computation
• Universal Fault-Tolerant Computation on Decoherence-Free Subspaces
• Quantum Computing with an 'Always On' Heisenberg Interaction
• Creating Decoherence-Free Subspaces with Strong and Fast Pulses
• Reducing Constraints on Quantum Computer Design by Encoded Selective Recoupling
• Quantum computation with un-tunable couplings
• Dispersive Manipulation of Paired Superconducting Qubits

Cited by in corpus (9)

• Decoherence effects on the quantum spin channels
• Macroscopic Einstein-Podolsky-Rosen pairs in superconducting circuits
• Optimized design of universal two-qubit gates
• Energetic Suppression of Decoherence in Exchange-Only Quantum Computation
• Dynamically stabilized decoherence-free states in non-Markovian open fermionic systems
• Always On Non-Nearest-Neighbor Coupling in Scalable Quantum Computing
• Fidelity, entanglement, and information complementarity relation
• Dynamical fidelity susceptibility of decoherence-free subspaces
• Many-particle confinement by constructed disorder and quantum computing