Limits of Fault-Tolerance on Resource-Constrained Quantum Circuits for Classical Problems

• URL: http://arxiv.org/abs/2301.02158v2
• Date: Thu, 26 Oct 2023 09:17:32 GMT
• Title: Limits of Fault-Tolerance on Resource-Constrained Quantum Circuits for Classical Problems
• Authors: Uthirakalyani.G, Anuj K. Nayak, Avhishek Chatterjee, Lav R. Varshney
• Abstract summary: We show that noise thresholds obtained from existing bounds do not apply to a simple fault-tolerant implementation of the Deutsch-Jozsa algorithm. We characterize the fundamental limit of fault-tolerant quantum circuits with classical inputs and outputs under resource constraint-induced noise models.
• Score: 16.56157299018674
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Existing lower bounds on redundancy in fault-tolerant quantum circuits are applicable when both the input and the intended output are quantum states. These bounds may not necessarily hold, however, when the input and the intended output are classical bits, as in the Deutsch-Jozsa, Grover, or Shor algorithms. Here we show that indeed, noise thresholds obtained from existing bounds do not apply to a simple fault-tolerant implementation of the Deutsch-Jozsa algorithm. Then we obtain the first lower bound on the minimum required redundancy for fault-tolerant quantum circuits with classical inputs and outputs. Recent results show that due to physical resource constraints in quantum circuits, increasing redundancy can increase noise, which in turn may render many fault-tolerance schemes useless. So it is of both practical and theoretical interest to characterize the effect of resource constraints on the fundamental limits of fault-tolerant quantum circuits. Thus as an application of our lower bound, we characterize the fundamental limit of fault-tolerant quantum circuits with classical inputs and outputs under resource constraint-induced noise models.

Related papers

• Fault-tolerant quantum input/output [6.787248655856051]
  We show that any quantum circuit with quantum input and output can be transformed into a fault-tolerant circuit. The framework allows the direct composition of the statements, enabling versatile future applications.
  arXiv  Detail & Related papers  (2024-08-09T12:26:38Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• 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)
• 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)
• A Converse for Fault-tolerant Quantum Computation [1.2031796234206134]
  In this paper, we obtain a lower bound on the redundancy required for $epsilon$-accurate implementation of a class of operations that includes unitary operators. For the practically relevant case of sub-exponential depth and sub-linear gate size, our bound on redundancy is tighter than the known lower bounds.
  arXiv  Detail & Related papers  (2022-11-01T18:43:14Z)
• Exponentially tighter bounds on limitations of quantum error mitigation [2.936007114555107]
  Quantum error mitigation has been proposed as a means to combat unwanted and unavoidable errors in near-term quantum computing. In this work, we identify strong limitations to the degree to which quantum noise can be effectively undone' for larger system sizes.
  arXiv  Detail & Related papers  (2022-10-20T18:12:42Z)
• Limitations of variational quantum algorithms: a quantum optimal transport approach [11.202435939275675]
  We obtain extremely tight bounds for standard NISQ proposals in both the noisy and noiseless regimes. The bounds limit the performance of both circuit model algorithms, such as QAOA, and also continuous-time algorithms, such as quantum annealing.
  arXiv  Detail & Related papers  (2022-04-07T13:58:44Z)
• Achieving fault tolerance against amplitude-damping noise [1.7289359743609742]
  We develop a protocol for fault-tolerant encoded quantum computing components in the presence of amplitude-damping noise. We describe a universal set of fault-tolerant encoded gadgets and compute the pseudothreshold for the noise. Our work demonstrates the possibility of applying the ideas of quantum fault tolerance to targeted noise models.
  arXiv  Detail & Related papers  (2021-07-12T14:59:54Z)
• Engineering fast bias-preserving gates on stabilized cat qubits [64.20602234702581]
  bias-preserving gates can significantly reduce resource overhead for fault-tolerant quantum computing. In this work, we apply a derivative-based leakage suppression technique to overcome non-adiabatic errors.
  arXiv  Detail & Related papers  (2021-05-28T15:20:21Z)
• 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)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.