Hybrid noise protection of logical qubits for universal quantum computation

• URL: http://arxiv.org/abs/2306.15144v2
• Date: Wed, 9 Aug 2023 03:16:56 GMT
• Title: Hybrid noise protection of logical qubits for universal quantum computation
• Authors: Zhao-Ming Wang, Feng-Hua Ren, Mark S. Byrd, and Lian-Ao Wu
• Abstract summary: We present a model of universal quantum computation that has many advantages over strategies that require a large overhead. We separate collective noise from individual noises on physical qubits and use a decoherence-free subspace. We are able to either use a steady global magnetic field or to devise a set of DD pulses that remove much of the remaining noise.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computers now show the promise of surpassing any possible classical machine. However, errors limit this ability and current machines do not have the ability to implement error correcting codes due to the limited number of qubits and limited control. Therefore, dynamical decoupling (DD) and encodings that limit noise with fewer qubits are more promising. For these reasons, we put forth a model of universal quantum computation that has many advantages over strategies that require a large overhead such as the standard quantum error correcting codes. First, we separate collective noise from individual noises on physical qubits and use a decoherence-free subspace (DFS) that uses just two qubits for its encoding to eliminate collective noise. Second, our bath model is very general as it uses a spin-boson type bath but without any Markovian assumption. Third, we are able to either use a steady global magnetic field or to devise a set of DD pulses that remove much of the remaining noise and commute with the logical operations on the encoded qubit. This allows removal of noise while implementing gate operations. Numerical support is given for this hybrid protection strategy which provides an efficient approach to deal with the decoherence problems in quantum computation and is experimentally viable for several current quantum computing systems. This is emphasized by a recent experiment on superconducting qubits which shows promise for increasing the number of gates that can be implemented reliably with some realistic parameter assumptions.

Related papers

• Towards early fault tolerance on a 2$\times$N array of qubits equipped with shuttling [0.0]
  Two-dimensional grid of locally-interacting qubits is promising platform for fault tolerant quantum computing. In this paper, we show that such constrained architectures can also support fault tolerance. We demonstrate that error correction is possible and identify the classes of codes that are naturally suited to this platform.
  arXiv  Detail & Related papers  (2024-02-19T23:31:55Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Limitations of Noisy Quantum Devices in Computational and Entangling Power [5.178527492542246]
  We show that noisy quantum devices with a circuit depth of more than $O(log n)$ provide no advantages in any quantum algorithms. We also study the maximal entanglement that noisy quantum devices can produce under one- and two-dimensional qubit connections.
  arXiv  Detail & Related papers  (2023-06-05T12:29:55Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Error mitigation for variational quantum algorithms through mid-circuit measurements [0.0]
  Noisy Intermediate-Scale Quantum (NISQ) algorithms require novel paradigms of error mitigation. We present mid-circuit post-selection schemes for frequently used encodings such as one-hot, binary, gray, and domain-wall encoding. We demonstrate the effectiveness of the approach for the Quantum Alternating Operator Ansatz algorithm.
  arXiv  Detail & Related papers  (2021-08-24T19:34:03Z)
• Moving beyond the transmon: Noise-protected superconducting quantum circuits [55.49561173538925]
  superconducting circuits offer opportunities to store and process quantum information with high fidelity. Noise-protected devices constitute a new class of qubits in which the computational states are largely decoupled from local noise channels. This Perspective reviews the theoretical principles at the heart of these new qubits, describes recent experiments, and highlights the potential of robust encoding of quantum information in superconducting qubits.
  arXiv  Detail & Related papers  (2021-06-18T18:00:13Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Recycling qubits in near-term quantum computers [1.2891210250935146]
  We propose a protocol that can unitarily reset qubits when the circuit has a common convolutional form. This protocol generates fresh qubits from used ones by partially applying the time-reversed quantum circuit over qubits that are no longer in use.
  arXiv  Detail & Related papers  (2020-12-03T03:24:50Z)
• The XZZX Surface Code [2.887393074590696]
  We show that a variant of the surface code -- the XZZX code -- offers remarkable performance for fault-tolerant quantum computation. The error threshold of this code matches what can be achieved with random codes (hashing) for every single-qubit Pauli noise channel. We show that it is possible to maintain all of these advantages when we perform fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2020-09-16T18:00:01Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.