Faster quantum computation with permutations and resonant couplings
arXiv:1901.00252 · doi:10.1016/j.laa.2020.01.020
Abstract
Recently, there has been increasing interest in designing schemes for quantum computations that are robust against errors. Although considerable research has been devoted to developing quantum error correction schemes, much less attention has been paid to optimizing the speed it takes to perform a quantum computation and developing computation models that act on decoherence-free subspaces. Speeding up a quantum computation is important, because fewer errors are likely to result. Encoding quantum information in a decoherence-free subspace is also important, because errors would be inherently suppressed. In this paper, we consider quantum computation in a decoherence-free subspace and also optimize its speed. To achieve this, we perform certain single-qubit quantum computations by simply permuting the underlying qubits. Together with exchange-interactions or Ising-interactions and other resonant couplings, we present a new scheme for quantum computation that potentially improves the speed in which a quantum computation can be done.
We revised the paper, including Theorem 1 and added more details for Theorem 2
References in corpus (20)
- Cavity quantum electrodynamics for superconducting electrical circuits: an architecture for quantum computation
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Universal Quantum Computation with the Exchange Interaction
- Keeping a Quantum Bit Alive by Optimized -Pulse Sequences
- Universal quantum computation with spin-1/2 pairs and Heisenberg exchange
- Concatenating Decoherence Free Subspaces with Quantum Error Correcting Codes
- Bosonic Quantum Codes for Amplitude Damping
- A quantum Fredkin gate
- Quantum error correction against photon loss using NOON states
- Coherence-Preserving Quantum Bits
- Simple Realization Of The Fredkin Gate Using A Series Of Two-body Operators
- One-step implementation of a hybrid Fredkin gate with quantum memories and single superconducting qubit in circuit QED and its applications
- Permutation-invariant constant-excitation quantum codes for amplitude damping
- High-Fidelity Hot Gates for Generic Spin-Resonator Systems
- Quantum Origami: Transversal Gates for Quantum Computation and Measurement of Topological Order
- Instantaneous braids and Dehn twists in topologically ordered states
- The magic of universal quantum computing with permutations
- Universal Uhrig dynamical decoupling for bosonic systems
- Clifford quantum computer and the Mathieu groups
- Quantum computing with Bianchi groups