Related papers: Experimental magic state distillation for fault-to…
Fault-tolerant quantum computation allows quantum computations to be carried out while resisting unwanted noise. Several error-correcting codes have been developed to achieve this task, but none alone are capable of universal quantum…
Decoherence is the main problem to be solved before quantum computers can be built. To control decoherence, it is possible to use error correction methods, but these methods are themselves noisy quantum computation processes. In this work…
Recently quantum states discrimination has been frequently studied. In this paper we study them from the other way round, the likeness of two quantum states. The fidelity is used to describe the likeness of two quantum states. Then we…
Magic state cultivation is a leading approach for generating the resource states required for fault-tolerant quantum computation. Here we present a new cultivation protocol that increases the success probability of magic-state generation in…
Fast, reliable logical operations are essential for realizing useful quantum computers. By redundantly encoding logical qubits into many physical qubits and using syndrome measurements to detect and correct errors, one can achieve low…
We use Nuclear Magnetic Resonance (NMR) to experimentally generate a bound entangled (more precisely: pseudo bound entangled) state, i.e. a quantum state which is non-distillable but nevertheless entangled. Our quantum system consists of…
Nonstabilizerness, also known as magic, is a crucial resource for quantum computation. The growth in complexity of quantum processing units (QPUs) demands robust and scalable techniques for characterizing this resource. We introduce the…
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…
The results of quantum process tomography on a three-qubit nuclear magnetic resonance quantum information processor are presented, and shown to be consistent with a detailed model of the system-plus-apparatus used for the experiments. The…
A long-standing open question about Gaussian continuous-variable cluster states is whether they enable fault-tolerant measurement-based quantum computation. The answer is yes. Initial squeezing in the cluster above a threshold value of 20.5…
We have taken significant steps towards the realization of a practical quantum computer: using nuclear spins and magnetic resonance techniques at room temperature, we provided proof of principle of quantum computing in a series of…
The precision and sensitivity achievable in quantum metrology are often compromised by the presence of noise. While quantum error correction has emerged as a promising strategy, it is ineffective in addressing noise that is…
Quantum states are inherently fragile, making their storage a major concern for many practical applications and experimental tests of quantum mechanics. The field of quantum memories is concerned with how this storage may be achieved,…
We extensively test a recent protocol to demonstrate quantum fault tolerance on three systems: (1) a real-time simulation of five spin qubits coupled to an environment with two-level defects, (2) a real-time simulation of transmon quantum…
Quantum computation and communication rely on the ability to manipulate quantum states robustly and with high fidelity. Thus, some form of error correction is needed to protect fragile quantum superposition states from corruption by…
In creating a large-scale quantum information processor, the ability to construct control pulses for implementing an arbitrary quantum circuit in a scalable manner is an important requirement. For liquid-state nuclear magnetic resonance…
One of the major challenges in realizing fault-tolerant quantum computers (FTQCs) is the requirement for a large number of physical qubits. To address this issue, high-rate quantum error correcting codes, which efficiently embed logical…
In order to use quantum error-correcting codes to actually improve the performance of a quantum computer, it is necessary to be able to perform operations fault-tolerantly on encoded states. I present a general theory of fault-tolerant…
Motivated by their necessity for most fault-tolerant quantum computation schemes, we formulate a resource theory for magic states. We first show that robustness of magic is a well-behaved magic monotone that operationally quantifies the…
It is exponentially hard to simulate quantum systems by classical algorithms, while quantum computer could in principle solve this problem polynomially. We demonstrate such an quantum-simulation algorithm on our NMR system to simulate an…