Limitations in quantum computing from resource constraints

• URL: http://arxiv.org/abs/2007.01966v3
• Date: Sun, 8 Aug 2021 09:49:22 GMT
• Title: Limitations in quantum computing from resource constraints
• Authors: Marco Fellous-Asiani, Jing Hao Chai, Robert S. Whitney, Alexia Auff\`eves, and Hui Khoon Ng
• Abstract summary: We show that the amount of error correction can be opti- mized, leading to a maximum attainable computational accuracy. This provides the basis for energetic estimates of future large-scale quantum computers.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerant schemes can use error correction to make a quantum computation arbitrarily ac- curate, provided that errors per physical component are smaller than a certain threshold and in- dependent of the computer size. However in current experiments, physical resource limitations like energy, volume or available bandwidth induce error rates that typically grow as the computer grows. Taking into account these constraints, we show that the amount of error correction can be opti- mized, leading to a maximum attainable computational accuracy. We find this maximum for generic situations where noise is scale-dependent. By inverting the logic, we provide experimenters with a tool to finding the minimum resources required to run an algorithm with a given computational accuracy. When combined with a full-stack quantum computing model, this provides the basis for energetic estimates of future large-scale quantum computers.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Efficient Quantum Circuit Encoding of Object Information in 2D Ray Casting [7.262444673139455]
  Quantum computing holds the potential to solve problems that are practically unsolvable by classical computers. We aim to harness this potential to enhance ray casting, a pivotal technique in computer graphics for simplifying the rendering of 3D objects.
  arXiv  Detail & Related papers  (2024-05-25T08:54:28Z)
• Resource-compact time-optimal quantum computation [5.034472655243636]
  Fault-tolerant quantum computation incurs a significant overhead from both time and resource perspectives. We present a quantum circuit that minimizes resource utilization for time-optimal quantum computation.
  arXiv  Detail & Related papers  (2024-04-30T20:47:35Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• 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)
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era [0.0]
  Fault-tolerant quantum computation (FTQC) is essential to implement quantum algorithms in a noise-resilient way. In FTQC, a quantum circuit is decomposed into universal gates that can be fault-tolerantly implemented. In this paper, we propose that the Clifford+$T$ decomposition error for a given quantum circuit can be modeled as the depolarizing noise.
  arXiv  Detail & Related papers  (2023-01-10T19:00:01Z)
• On proving the robustness of algorithms for early fault-tolerant quantum computers [0.0]
  We introduce a randomized algorithm for the task of phase estimation and give an analysis of its performance under two simple noise models. We calculate that the randomized algorithm can succeed with arbitrarily high probability as long as the required circuit depth is less than 0.916 times the dephasing scale.
  arXiv  Detail & Related papers  (2022-09-22T21:28:12Z)
• The resource cost of large scale quantum computing [0.0]
  We focus on the energetic cost of quantum computing. In particular, we develop an inter-disciplinary approach that allows to minimize the resources required to implement algorithms. We apply this approach to a complete model fault-tolerant quantum computer based on superconducting qubits.
  arXiv  Detail & Related papers  (2021-12-07T22:27:12Z)
• 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)
• Statistical Limits of Supervised Quantum Learning [90.0289160657379]
  We show that if the bound on the accuracy is taken into account, quantum machine learning algorithms for supervised learning cannot achieve polylogarithmic runtimes in the input dimension. We conclude that, when no further assumptions on the problem are made, quantum machine learning algorithms for supervised learning can have at most speedups over efficient classical algorithms.
  arXiv  Detail & Related papers  (2020-01-28T17:35:32Z)

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.