English
Related papers

Related papers: Space-Efficient Error Reduction for Unitary Quantu…

200 papers

Quantum error correction (QEC) is essential for quantum computers to perform useful algorithms, but large-scale fault-tolerant computation remains out of reach due to demanding requirements on operation fidelity and the number of…

The detrimental effect of noise accumulates as quantum computers grow in size. In the case where devices are too small or noisy to perform error correction, error mitigation may be used. Error mitigation does not increase the fidelity of…

Quantum Physics · Physics 2023-07-19 Cristina Cirstoiu , Silas Dilkes , Daniel Mills , Seyon Sivarajah , Ross Duncan

Quantum computation promises applications that are thought to be impossible with classical computation. To realize practical quantum computation, the following three properties will be necessary: universality, scalability, and…

Estimates of the quantum accuracy threshold often tacitly assume that it is possible to interact arbitrary pairs of qubits in a quantum computer with a failure rate that is independent of the distance between them. None of the many physical…

Quantum Physics · Physics 2013-05-29 A. M. Stephens , Z. W. E. Evans

In one-way quantum computation (1WQC) model, universal quantum computations are performed using measurements to designated qubits in a highly entangled state. The choices of bases for these measurements as well as the structure of the…

Emerging Technologies · Computer Science 2016-04-20 Eesa Nikahd , Mahboobeh Houshmand , Morteza Saheb Zamani , Mehdi Sedighi

The most general method for encoding quantum information is not to encode the information into a subspace of a Hilbert space, but to encode information into a subsystem of a Hilbert space. Recently this notion has led to a more general…

Quantum Physics · Physics 2008-01-22 Dave Bacon

Computational quantum technologies are entering a new phase in which noisy intermediate-scale quantum computers are available, but are still too small to benefit from active error correction. Even with a finite coherence budget to invest in…

Quantum Physics · Physics 2019-12-13 G. G. Guerreschi , A. Y. Matsuura

Polynomial--time constant--space quantum Turing machines (QTMs) and logarithmic--space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (Say and Yakary\i lmaz 2014, arXiv:1411.7647). In this…

Computational Complexity · Computer Science 2016-08-02 Maksims Dimitrijevs , Abuzer Yakaryılmaz

We propose a quantum algorithm that emulates the action of an unknown unitary transformation on a given input state, using multiple copies of some unknown sample input states of the unitary and their corresponding output states. The…

Quantum Physics · Physics 2024-03-27 Iman Marvian , Seth Lloyd

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…

Quantum Physics · Physics 2017-02-20 Peter W. Shor

As fully fault-tolerant quantum computers capable of solving useful problems remain a distant goal, we anticipate an era of "early fault tolerance" where limited error correction is available. We propose a framework for designing early…

We propose a single auxiliary-assisted purification-based framework for quantum error correction, capable of correcting errors that drive a system from its ground-state subspace into excited-state sectors. The protocol consists of a joint…

Quantum Physics · Physics 2025-12-11 Chandrima B. Pushpan , Tanoy Kanti Konar , Aditi Sen De , Amit Kumar Pal

Known quantum error correction schemes are typically able to take advantage of only a limited class of classical error-correcting codes. Entanglement-assisted quantum error correction is a partial solution which made it possible to exploit…

Quantum Physics · Physics 2013-04-24 Yuichiro Fujiwara

A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations to a universal set by the addition of `magic' quantum states. In this context, we develop a general…

Quantum Physics · Physics 2022-04-12 Matteo Lostaglio , Alessandro Ciani

Quantum error correction is capable of digitizing quantum noise and increasing the robustness of qubits. Typically, error correction is designed with the target of eliminating all errors - making an error so unlikely it can be assumed that…

Quantum Physics · Physics 2022-05-20 Salonik Resch , Ulya R. Karpuzcu

We study quantum algorithms that are given access to trusted and untrusted quantum witnesses. We establish strong limitations of such algorithms, via new techniques based on Laurent polynomials (i.e., polynomials with positive and negative…

Quantum Physics · Physics 2021-03-18 Scott Aaronson , Robin Kothari , William Kretschmer , Justin Thaler

One of the fundamental conditions for one-way quantum computation (1WQC) is the ability to make sequential measurements on isolated qubits that comprise the highly entangled resource for 1WQC, the cluster state. This has been a significant…

Quantum Physics · Physics 2009-11-13 Timothy P. Friesen , David L. Feder

Mitigating measurement errors in quantum systems without relying on quantum error correction is of critical importance for the practical development of quantum technology. Deep learning-based quantum measurement error mitigation has…

Quantum Physics · Physics 2024-08-12 ChangWon Lee , Daniel K. Park

While adiabatic quantum computation (AQC) possesses some intrinsic robustness to noise, it is expected that a form of error control will be necessary for large scale computations. Error control ideas developed for circuit-model quantum…

Quantum Physics · Physics 2013-11-20 Kevin C. Young , Mohan Sarovar

A foundational result in the theory of quantum computation known as the "principle of safe storage" shows that it is always possible to take a quantum circuit and produce an equivalent circuit that makes all measurements at the end of the…

Computational Complexity · Computer Science 2021-03-05 Bill Fefferman , Zachary Remscrim