English
Related papers

Related papers: Quantum Measurements and Gates by Code Deformation

200 papers

How important is fast measurement for fault-tolerant quantum computation? Using a combination of existing and new ideas, we argue that measurement times as long as even 1,000 gate times or more have a very minimal effect on the quantum…

Quantum Physics · Physics 2007-10-09 David P. DiVincenzo , Panos Aliferis

Qudits can be described by a state vector in a $q$-dimensional Hilbert space, enabling a more extensive encoding and manipulation of information compared to qubits. This implies that conducting fault-tolerant quantum computations using…

Quantum Physics · Physics 2025-09-08 James Keppens , Quinten Eggerickx , Vukan Levajac , George Simion , Bart Sorée

Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…

Quantum Physics · Physics 2009-10-30 Emanuel Knill , Raymond Laflamme , Wojciech H. Zurek

Although qubit coherence times and gate fidelities are continuously improving, logical encoding is essential to achieve fault tolerance in quantum computing. In most encoding schemes, correcting or tracking errors throughout the computation…

Quantum properties of the probes used to estimate a classical parameter can be used to attain accuracies that beat the standard quantum limit. When qubits are used to construct a quantum probe, it is known that initializing $n$ qubits in an…

Quantum Physics · Physics 2009-11-13 Anil Shaji , Carlton M. Caves

Surface and color codes are two forms of topological quantum error correction in two spatial dimensions with complementary properties. Surface codes have lower-depth error detection circuits and well-developed decoders to interpret and…

Quantum Physics · Physics 2016-10-18 Jonathan E. Moussa

The states needed in a quantum computation are extremely affected by decoherence. Several methods have been proposed to control error spreading. They use two main tools: fault-tolerant constructions and concatenated quantum error correcting…

Quantum Physics · Physics 2007-05-23 Pedro J. Salas , Angel L. Sanz

Quantum computers will require encoding of quantum information to protect them from noise. Fault-tolerant quantum computing architectures illustrate how this might be done but have not yet shown a conclusive practical advantage. Here we…

Quantum Physics · Physics 2019-03-01 Robin Harper , Steven T. Flammia

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

The paradigm of measurement-based quantum computation opens new experimental avenues to realize a quantum computer and deepens our understanding of quantum physics. Measurement-based quantum computation starts from a highly entangled…

The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…

Quantum Physics · Physics 2008-09-16 Stephen P. Jordan

In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of…

Quantum Physics · Physics 2007-05-23 Richard Jozsa

Topological quantum computation is a promising technique to achieve large-scale, error-corrected computation. Quantum hardware is used to create a large, 3-dimensional lattice of entangled qubits while performing computation requires…

Quantum Physics · Physics 2014-04-04 Alexandru Paler , Simon J. Devitt , Kae Nemoto , Ilia Polian

We consider measurement-based quantum computation using the state of a spin-lattice system in equilibrium with a thermal bath and free to evolve under its own Hamiltonian. Any single qubit measurements disturb the system from equilibrium…

Quantum Physics · Physics 2009-09-23 David Jennings , Andrzej Dragan , Sean D. Barrett , Stephen D. Bartlett , Terry Rudolph

I will give an overview of what I see as some of the most important future directions in the theory of fault-tolerant quantum computation. In particular, I will give a brief summary of the major problems that need to be solved in fault…

Quantum Physics · Physics 2022-10-31 Daniel Gottesman

Quantum computing can provide speedups in solving many problems as the evolution of a quantum system is described by a unitary operator in an exponentially large Hilbert space. Such unitary operators change the phase of their eigenstates…

Quantum Physics · Physics 2024-01-23 Youle Wang , Lei Zhang , Zhan Yu , Xin Wang

Quantum computations are expressed in general as quantum circuits, which are specified by ordered lists of quantum gates. The resulting specifications are used during the optimisation and execution of the expressed computations. However,…

Quantum Physics · Physics 2018-08-08 Alexandru Paler , Simon J. Devitt

The construction of a quantum computer remains a fundamental scientific and technological challenge, in particular due to unavoidable noise. Quantum states and operations can be protected from errors using protocols for fault-tolerant…

Quantum error correction works effectively only if the error rate of gate operations is sufficiently low. However, some rare physical mechanisms can cause a temporary increase in the error rate that affects many qubits; examples include…

Quantum Physics · Physics 2024-06-28 Shi Jie Samuel Tan , Christopher A. Pattison , Matt McEwen , John Preskill

The stable operation of quantum computers will rely on error-correction, in which single quantum bits of information are stored redundantly in the Hilbert space of a larger system. Such encoded qubits are commonly based on arrays of many…