Measurement-free fault-tolerant quantum computing

We investigate how to concatenate different decoherence-free subspaces 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 a 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.We investigate how to concatenate different decoherence-free subspaces 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 a 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.

arXiv:quant-ph/0407241Physical Review LettersJun 1, 200416 citations

Fault-tolerant Quantum Computing

Yasunari Suzuki

The Journal of The Institute of Image Information and Television EngineersJan 1, 20220 citations

Measurement-free preparation of grid states

Jacob Hastrup, Ki-min Park B, Jonatan Bohr Brask +2 more

Abstract Quantum computing potentially offers exponential speed-ups over classical computing for certain tasks. A central, outstanding challenge to making quantum computing practical is to achieve fault tolerance, meaning that computations of any length or size can be realized in the presence of noise. The Gottesman-Kitaev-Preskill code is a promising approach toward fault-tolerant quantum computing, encoding logical qubits into grid states of harmonic oscillators. However, for the code to be fault tolerant, the quality of the grid states has to be extremely high. Approximate grid states have recently been realized experimentally, but their quality is still insufficient for fault tolerance. Current implementable protocols for generating grid states rely on measurements of ancillary qubits combined with either postselection or feed forward. Implementing such measurements take up significant time during which the states decohere, thus limiting their quality. Here, we propose a measurement-free preparation protocol, which deterministically prepares arbitrary logical grid states with a rectangular or hexagonal lattice. The protocol can be readily implemented in trapped-ion or superconducting-circuit platforms to generate high-quality grid states using only a few interactions, even with the noise levels found in current systems.Abstract Quantum computing potentially offers exponential speed-ups over classical computing for certain tasks. A central, outstanding challenge to making quantum computing practical is to achieve fault tolerance, meaning that computations of any length or size can be realized in the presence of noise. The Gottesman-Kitaev-Preskill code is a promising approach toward fault-tolerant quantum computing, encoding logical qubits into grid states of harmonic oscillators. However, for the code to be fault tolerant, the quality of the grid states has to be extremely high. Approximate grid states have recently been realized experimentally, but their quality is still insufficient for fault tolerance. Current implementable protocols for generating grid states rely on measurements of ancillary qubits combined with either postselection or feed forward. Implementing such measurements take up significant time during which the states decohere, thus limiting their quality. Here, we propose a measurement-free preparation protocol, which deterministically prepares arbitrary logical grid states with a rectangular or hexagonal lattice. The protocol can be readily implemented in trapped-ion or superconducting-circuit platforms to generate high-quality grid states using only a few interactions, even with the noise levels found in current systems.

arXiv:1912.12645npj Quantum InformationJan 29, 202154 citations

We investigate how to concatenate different decoherence-free subspaces 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 a 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.