Related papers: Polynomial procedure of avoiding multiqubit errors…
Quantum computation, a completely different paradigm of computing, benefits from theoretically proven speed-ups for certain problems and opens up the possibility of exactly studying the properties of quantum systems. Yet, because of the…
Modern programming relies on our ability to treat preprogrammed functions as black boxes - we can invoke them as subroutines without knowing their physical implementation. Here we show it is generally impossible to execute an unknown…
Decoherence is a fundamental obstacle to the implementation of large-scale and low-noise quantum information processing devices. In this work, we suggest an approach for suppressing errors by employing pre-processing and post-processing…
We observe that multi-body interactions, unlike two-body interactions, can implement any unitary operation on an encoded system in such a way that the evolution is uninterrupted by noise that the encoding is designed to protect against.…
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…
Quantum computing tries to exploit entanglement and interference to process information more efficiently than the best known classical solutions. Experiments demonstrating the feasibility of this approach have already been performed.…
Quantum computation has received great attention in recent years for its possible application to difficult problem in classical calculation. Despite the experimental problems of implementing quantum devices, theoretical physicists have…
Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers…
Scalable quantum information processing requires the ability to tune multi-qubit interactions. This makes the precise manipulation of quantum states particularly difficult for multi-qubit interactions because tunability unavoidably…
The concept of quantum interleaver and a simple method of quantum burst-error correction is proposed. By using the quantum interleaver, any quantum burst-errors that have occurred spread over the interleaved code word, so that we can…
Quantum bits have technological imperfections. Additionally, the capacity of a component that can be implemented feasibly is limited. Therefore, distributed quantum computation is required to scale up quantum computers. This dissertation…
Errors in quantum computers are of two kinds: sudden perturbations to isolated qubits, and slow random drifts of all the qubits. The latter may be reduced, but not eliminated, by means of symmetrization, namely by using many replicas of the…
People are witnessing quantum computing revolutions nowadays. Progress in the number of qubits, coherence times and gate fidelities are happening. Although quantum error correction era has not arrived, the research and development of…
Quantum phase estimation is one of the key algorithms in the field of quantum computing, but up until now, only approximate expressions have been derived for the probability of error. We revisit these derivations, and find that by ensuring…
An experiment is proposed to test the interference aspect of the Quantum Interference Computer approach
Realisation of experiments even on small and medium-scale quantum computers requires an optimisation of several parameters to achieve high-fidelity operations. As the size of the quantum register increases, the characterisation of quantum…
We present a method for quantum error mitigation on partially error-corrected quantum computers - i.e., computers with some logical qubits and some noisy qubits. Our method is inspired by the error cancellation method and is implemented via…
In the effort to design and to construct a quantum computer, several leading proposals make use of spin-based qubits. These designs generally assume that spins undergo pairwise interactions. We point out that, when several spins are engaged…
We have investigated instability of a superconducting quantum computer by continuously monitoring the qubit output. We found that qubits exhibit a step-like change in the error rates. This change is repeatedly observed, and each step…
An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the…