Resilience of quantum random access memory to generic noise
- URL: http://arxiv.org/abs/2012.05340v2
- Date: Mon, 7 Jun 2021 16:47:21 GMT
- Title: Resilience of quantum random access memory to generic noise
- Authors: Connor T. Hann, Gideon Lee, S. M. Girvin, Liang Jiang
- Abstract summary: We study the effects of decoherence on Quantum Random Access Memory (QRAM) in full generality.
Our proof identifies the origin of this noise resilience as the limited entanglement among the memory's components.
We prove that high-fidelity queries are possible without quantum error correction.
- Score: 2.5496329090462626
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum random access memory (QRAM)--memory which stores classical data but
allows queries to be performed in superposition--is required for the
implementation of numerous quantum algorithms. While naive implementations of
QRAM are highly susceptible to decoherence and hence not scalable, it has been
argued that the bucket brigade QRAM architecture [Giovannetti et al., Phys.
Rev. Lett. 100 160501 (2008)] is highly resilient to noise, with the infidelity
of a query scaling only logarithmically with the memory size. In prior
analyses, however, this favorable scaling followed directly from the use of
contrived noise models, thus leaving open the question of whether experimental
implementations would actually enjoy the purported scaling advantage. In this
work, we study the effects of decoherence on QRAM in full generality. Our main
result is a proof that this favorable infidelity scaling holds for arbitrary
error channels (including, e.g., depolarizing noise and coherent errors). Our
proof identifies the origin of this noise resilience as the limited
entanglement among the memory's components, and it also reveals that
significant architectural simplifications can be made while preserving the
noise resilience. We verify these results numerically using a novel classical
algorithm for the efficient simulation of noisy QRAM circuits. Our findings
indicate that QRAM can be implemented with existing hardware in realistically
noisy devices, and that high-fidelity queries are possible without quantum
error correction. Furthermore, we also prove that the benefits of the
bucket-brigade architecture persist when quantum error correction is used, in
which case the scheme offers improved hardware efficiency and resilience to
logical errors.
Related papers
- Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations.
We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes.
Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
arXiv Detail & Related papers (2023-12-21T17:40:18Z) - Quantum random access memory architectures using superconducting cavities [0.0]
We propose two bucket-brigade QRAM architectures based on high-coherence superconducting resonators.
We analyze single-rail and dual-rail implementations of a bosonic qubit.
For parameter regimes of interest the post-selected infidelity of a QRAM query in a dual-rail architecture is nearly an order of magnitude below that of a corresponding query in a single-rail architecture.
arXiv Detail & Related papers (2023-10-12T12:45:39Z) - Systems Architecture for Quantum Random Access Memory [0.6386668251980657]
Quantum random access memory (QRAM) is a promising architecture for realizing quantum queries.
We show how to leverage the intrinsic biased-noise resilience of the proposed QRAM for implementation on either Noisy Intermediate-Scale Quantum (NISQ) or Fault-Tolerant Quantum Computing (FTQC) hardware.
arXiv Detail & Related papers (2023-06-05T20:52:28Z) - Leveraging hardware-control imperfections for error mitigation via
generalized quantum subspace [0.8399688944263843]
In the era of quantum computing without full fault-tolerance, it is essential to suppress noise effects via the quantum error mitigation techniques to enhance the computational power of the quantum devices.
One of the most effective noise-agnostic error mitigation schemes is the generalized quantum subspace expansion (GSE) method.
We propose the fault-subspace method, which constructs an error-mitigated quantum state with copies of quantum states with different noise levels.
arXiv Detail & Related papers (2023-03-14T07:01:30Z) - Evaluating the Resilience of Variational Quantum Algorithms to Leakage
Noise [6.467585493563487]
Leakage noise is a damaging source of error that error correction approaches cannot handle.
The impact of this noise on the performance of variational quantum algorithms (VQAs) is yet unknown.
arXiv Detail & Related papers (2022-08-10T14:50:14Z) - Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity.
We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree.
These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
arXiv Detail & Related papers (2022-01-06T21:02:30Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z) - 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) - Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies.
We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived.
This is the first quantum protocol that can be used against the most general adversaries.
arXiv Detail & Related papers (2020-03-20T17:56:14Z) - Parallelising the Queries in Bucket Brigade Quantum RAM [69.43216268165402]
Quantum algorithms often use quantum RAMs (QRAM) for accessing information stored in a database-like manner.
We show a systematic method to significantly reduce the effective query time by using Clifford+T gate parallelism.
We conclude that, in theory, fault-tolerant bucket brigade quantum RAM queries can be performed approximately with the speed of classical RAM.
arXiv Detail & Related papers (2020-02-21T14:50:03Z)
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.