Related papers: Robust fault tolerance for continuous-variable clu…

Quantum key distribution (QKD) enables two remote parties to grow a shared key which they can use for unconditionally secure communication [1]. The applicable distance of a QKD protocol depends on the loss and the excess noise of the…

Recent progress in quantum information has led to the start of several large national and industrial efforts to build a quantum computer. Researchers are now working to overcome many scientific and technological challenges. The program's…

Experimental detection of entanglement in superconducting qubits has been mostly limited, for more than two qubits, to witness-based and related approaches that can certify the presence of some entanglement, but not rigorously quantify how…

Cubic phase states provide the essential non-Gaussian resource for continuous-variable quantum computing. We show that they also offer significant potential for quantum metrology, surpassing the phase-sensing sensitivity of all Gaussian…

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…

The schemes for fault-tolerant postselected quantum computation given in [Knill, Fault-Tolerant Postselected Quantum Computation: Schemes, http://arxiv.org/abs/quant-ph/0402171] are analyzed to determine their error-tolerance. The analysis…

We show that measurement-based quantum computation on scalable continuous-variable (CV) cluster states admits more quantum-circuit flexibility and compactness than similar protocols for standard square-lattice CV cluster states. This…

The performance requirements for fault-tolerant quantum computing are very stringent. Qubits must be manipulated, coupled, and measured with error rates well below 1%. For semiconductor implementations, silicon quantum dot spin qubits have…

Noise-biased qubits are a promising route toward significantly reducing the hardware overhead associated with quantum error correction. The squeezed cat code, a non-local encoding in phase space based on squeezed coherent states, is an…

Fault-tolerant quantum error correction provides a strategy to protect information processed by a quantum computer against noise which would otherwise corrupt the data. A fault-tolerant universal quantum computer must implement a universal…

We study the stabilities of quantum states of macroscopic systems, against noises, against perturbations from environments, and against local measurements. We show that the stabilities are closely related to the cluster property, which…

Logical qubits can be protected from decoherence by performing QEC cycles repeatedly. Algorithms for fault-tolerant QEC must be compiled to the specific hardware platform under consideration in order to practically realize a quantum memory…

We calculate the fidelity with which an arbitrary state can be encoded into a [7,1,3] CSS quantum error correction code in a non-equiprobable Pauli operator error environment with the goal of determining whether this encoding can be used…

We reduce the extra qubits needed for two fault-tolerant quantum computing protocols: error correction, specifically syndrome bit measurement, and cat state preparation. For distance-three fault-tolerant syndrome extraction, we show an…

Optical continuous-variable cluster states (CVCSs) in combination with Gottesman-Kitaev-Preskill~(GKP) qubits enable fault-tolerant quantum computation so long as these resources are of high enough quality. Previous studies concluded that a…

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 prove that quantum expander codes can be combined with quantum fault-tolerance techniques to achieve constant overhead: the ratio between the total number of physical qubits required for a quantum computation with faulty hardware and the…

I make a rough estimate of the accuracy threshold for fault tolerant quantum computing with concatenated codes. First I consider only gate errors and use the depolarizing channel error model. I will follow P.Shor (quant-ph/9505011) for…

An arbitrarily reliable quantum computer can be efficiently constructed from noisy components using a recursive simulation procedure, provided that those components fail with probability less than the fault-tolerance threshold. Recent…

Quantum error mitigation has been proposed as a means to combat unwanted and unavoidable errors in near-term quantum computing without the heavy resource overheads required by fault tolerant schemes. Recently, error mitigation has been…