相关论文: Threshold Accuracy for Quantum Computation
Successful implementation of a fault-tolerant quantum computation on a system of qubits places severe demands on the hardware used to control the many-qubit state. It is known that an accuracy threshold $P_{a}$ exists for any quantum gate…
A major challenge in practical quantum computation is the ineludible errors caused by the interaction of quantum systems with their environment. Fault-tolerant schemes, in which logical qubits are encoded by several physical qubits, enable…
We describe a scalable experimental protocol for obtaining estimates of the error rate of individual quantum computational gates. This protocol, in which random Clifford gates are interleaved between a gate of interest, provides a bounded…
Quantum computing is poised to redefine the algorithmic foundations of communication systems. While quantum superposition and entanglement enable quadratic or exponential speedups for specific problems, identifying use cases where these…
Quantum computing using two optical coherent states as qubit basis states has been suggested as an interesting alternative to single photon optical quantum computing with lower physical resource overheads. These proposals have been…
An experimental success criterion for continuous-variable quantum teleportation and memories is to surpass a limit of the average fidelity achieved by the classical measure-and-prepare schemes with respect to a Gaussian distributed set of…
The goal of this paper is to review the theoretical basis for achieving a faithful quantum information transmission and processing in the presence of noise. Initially encoding and decoding, implementing gates and quantum error correction…
We compare and contrast the error probability and fidelity as measures of the quality of the receiver's measurement strategy for a quantum communications system. The error probability is a measure of the ability to retrieve {\it classical}…
State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately, or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the…
The errors that arise in a quantum channel can be corrected perfectly if and only if the channel does not decrease the coherent information of the input state. We show that, if the loss of coherent information is small, then approximate…
Accurate methods of assessing the performance of quantum gates are extremely important. Quantum process tomography and randomized benchmarking are the current favored methods. Quantum process tomography gives detailed information, but…
Proving threshold theorems for fault-tolerant quantum computation is a burdensome endeavor with many moving parts that come together in relatively formulaic but lengthy ways. It is difficult and rare to combine elements from multiple papers…
The purpose of this little survey is to give a simple description of the main approaches to quantum error correction and quantum fault-tolerance. Our goal is to convey the necessary intuitions both for the problems and their solutions in…
Usual scenarios of fault-tolerant computation are concerned with the fault-tolerant realization of quantum algorithms that compute classical functions, such as Shor's algorithm for factoring. In particular, this means that input and output…
This study presents a roadmap towards utilizing a single arbitrary gate for universal quantum computing. Since two decades ago, it has been widely accepted that almost any single arbitrary gate with qubit number $>2$ is universal. Utilizing…
Quantum sensing utilize quantum effects, such as entanglement and coherence, to measure physical signals. The performance of a sensing process is characterized by error which requires comparison to a true value. However, in practice, such a…
Armed with quantum correlations, quantum sensors in a network have shown the potential to outclass their classical counterparts in distributed sensing tasks such as clock synchronization and reference frame alignment. On the other hand,…
Quantum information can be protected from decoherence and other errors, but only if these errors are sufficiently rare. For quantum computation to become a scalable technology, practical schemes for quantum error correction that can…
Arbitrarily accurate fault-tolerant (FT) universal quantum computation can be carried out using the Clifford gates Z, S, CNOT plus the non-Clifford T gate. Moreover, a recent improvement of the Solovay-Kitaev theorem by Kuperberg implies…
This is a brief review of the experimental and theoretical quantum computing. The hopes for eventually building a useful quantum computer rely entirely on the so-called "threshold theorem". In turn, this theorem is based on a number of…