We present a comprehensive and self-contained simplified review of the quantum computing scheme of Phys. Rev. Lett. 98, 190504 (2007), which features a 2-D nearest neighbor coupled lattice of qubits, a threshold error rate approaching 1%, natural asymmetric and adjustable strength error correction and low overhead arbitrarily long-range logical gates. These features make it by far the best and most practical quantum computing scheme devised to date. We restrict the discussion to direct manipulation of the surface code using the stabilizer formalism, both of which we also briefly review, to make the scheme accessible to a broad audience.
We investigate measurement-based entanglement purification protocols (EPP) in the presence of local noise and imperfections. We derive a universal, protocol-independent threshold for the required quality of the local resource states, where we show that local noise per particle of up to 24% is tolerable. This corresponds to an increase of the noise threshold by almost an order of magnitude, based on the joint measurement-based implementation of sequential rounds of few-particle EPP. We generalize our results to multipartite EPP, where we encounter similarly high error thresholds.
Quantum error correction and fault-tolerance make it possible to perform quantum computations in the presence of imprecision and imperfections of realistic devices. An important question is to find the noise rate at which errors can be arbitrarily suppressed. By concatenating the 7-qubit Steane and 15-qubit Reed-Muller codes, the 105-qubit code enables a universal set of fault-tolerant gates despite not all of them being transversal. Importantly, the CNOT gate remains transversal in both codes, and as such has increased error protection relative to the other single qubit logical gates. We show…
Dynamical properties of lattice systems with long-range pair interactions, decaying like 1/r^α with the distance r, are investigated, in particular the time scales governing the relaxation to equilibrium. Upon varying the interaction range α, we find evidence for the existence of a threshold at α=d/2, dependent on the spatial dimension d, at which the relaxation behavior changes qualitatively and the corresponding scaling exponents switch to a different regime. Based on analytical as well as numerical observations in systems of vastly differing nature, ranging from quantum to classical, from f…
We study how much noise can be tolerated by a universal gate set before it loses its quantum-computational power. Specifically we look at circuits with perfect stabilizer operations in addition to imperfect non-stabilizer gates. We prove that for all unitary single-qubit gates there exists a tight depolarizing noise threshold that determines whether the gate enables universal quantum computation or if the gate can be simulated by a mixture of Clifford gates. This exact threshold is determined by the Clifford polytope spanned by the 24 single-qubit Clifford gates. The result is in contrast to t…
The transmission of photons through open-air or an optical fiber is an important primitive in quantum information processing. Theoretical description of such a transmission process often considers only a single photon as the information carrier and thus fails to accurately describe experimental optical implementations where any number of photons may enter a detector. It is important to bridge this big gap between experimental implementations and the theoretical description. One powerful method that emerges from recent efforts to achieve this goal is to consider a squash model that conceptually…
Fault-tolerant quantum computers which can solve hard problems rely on quantum error correction. One of the most promising error correction codes is the surface code, which requires universal gate fidelities exceeding the error correction threshold of 99 per cent. Among many qubit platforms, only superconducting circuits, trapped ions, and nitrogen-vacancy centers in diamond have delivered those requirements. Electron spin qubits in silicon are particularly promising for a large-scale quantum computer due to their nanofabrication capability, but the two-qubit gate fidelity has been limited to …
Demonstrating quantum supremacy, a complexity-guaranteed quantum advantage against over the best classical algorithms by using less universal quantum devices, is an important near-term milestone for quantum information processing. Here we develop a threshold theorem for quantum supremacy with noisy quantum circuits in the pre-threshold region, where quantum error correction does not work directly. We show that, even in such a region, we can virtually simulate quantum error correction by postselection. This allows us to show that the output sampled from the noisy quantum circuits (without posts…
We use quantum process tomography to characterize a full universal set of all-microwave gates on two superconducting single-frequency single-junction transmon qubits. All extracted gate fidelities, including those for Clifford group generators, single-qubit pi/4 and pi/8 rotations, and a two-qubit controlled-NOT, exceed 95% (98%), without (with) accounting for state preparation and measurement errors. Furthermore, we introduce a process map representation in the Pauli basis which is visually efficient and informative. This high-fidelity gate set serves as another critical building block toward…
We analyze the resource overhead of recently proposed methods for universal fault-tolerant quantum computation using concatenated codes. Namely, we examine the concatenation of the 7-qubit Steane code with the 15-qubit Reed-Muller code, which allows for the construction of the 49 and 105-qubit codes that do not require the need for magic state distillation for universality. We compute a lower bound for the adversarial noise threshold of the 105-qubit code and find it to be $8.33\times 10^{-6}.$ We obtain a depolarizing noise threshold for the 49-qubit code of $9.69\times 10^{-4}$ which is comp…
We propose a method for general-purpose quantum computation and simulation that is well suited for today's pre-threshold-fidelity superconducting qubits. This approach makes use of the $n$-dimensional single-excitation subspace (SES) of a system of $n$ tunably coupled qubits. It can be viewed as a nonscalable special case of the standard gate-based quantum computing model, but allows many operations in the unitary group SU($n$) to be implemented by a single application of the Hamiltonian. Our approach bypasses the need to decompose the evolution operator into elementary gates, making large, no…
We consider a time dependent trap externally manipulated in such a way that one of its bound states is brought into an instant contact with the continuum threshold, and then down again. It is shown that, in the limit of slow evolution, the probability to remain in the bound state, $P^{stay}$ tends to a universal limit, and is determined only by the manner in which the adiabatic bound state approaches and leaves the threshold. The task of evaluating the $P^{stay}$ in the adiabatic limit can be reduced to studying the loss from a zero range well, and is performed numerically. Various types of tr…
We provide the first example of a symmetry protected quantum phase that has universal computational power. Throughout this phase, which lives in spatial dimension two, the ground state is a universal resource for measurement based quantum computation.
Error-correction process has to be carried out periodically to prevent accumulation of errors in fault-tolerant quantum computation. It is believed that the best choice to get maximum threshold value is carrying out an error-correction process after each quantum gate operation. Result of this note shows that the optimal error-correction period depends on the value of k which is the level number of concatenated quantum error-correction code.
In the presence of non-Hermitian skin effect, non-Hermitian lattices generally have complex-valued eigenenergies under periodic boundary condition, but they can have non-Bloch PT symmetry and therefore completely real eigenenergies under open boundary condition. This novel PT symmetry and its breaking have been experimentally observed in one dimension. Here, we find that non-Bloch PT symmetry in two and higher dimensions exhibits drastically different behaviors compared to its one-dimensional counterpart. Whereas Bloch PT breaking and one-dimensional non-Bloch PT breaking generally have nonzer…
Quantized integrable systems can be made to perform universal quantum computation by the application of a global time-varying control. The action-angle variables of the integrable system function as qubits or qudits, which can be coupled selectively by the global control to induce universal quantum logic gates. By contrast, chaotic quantum systems, even if controllable, do not generically allow quantum computation under global control.
Universal quantum computation is usually associated with interaction among two-level quantum subsystems, as this interaction is commonly viewed as a necessity to achieve universal quantum computation. In this work, we show that, contrary to this intuition, universal quantum computation can be achieved without interaction among initially independent two-level quantum subsystems. We call it counterfactual universal quantum computation. As special cases, we show how to achieve counterfactual communication of quantum states, counterfactual quantum swapping, and counterfactual quantum erasure codes…
We consider a two-dimensional quantum memory of qubits on a torus which encode the extended Fibonaccistring-net code, and devise strategies for error correction when those qubits are subjected to depolarizing noise.Building on the concept of tube algebras, we construct a set of measurements and of quantum gates whichmap arbitrary qubit errors to the string-net subspace and allow for the characterization of the resulting errorsyndrome in terms of doubled Fibonacci anyons. Tensor network techniques then allow to quantitatively studythe action of Pauli noise on the string-net subspace. We perform…
We describe how continuous-variable abelian anyons, created on the surface of a continuous-variable analogue of Kitaev's lattice model can be utilized for quantum computation. In particular, we derive protocols for the implementation of quantum gates using topological operations. We find that the topological operations alone are insufficient for universal quantum computation which leads us to study additional non-topological operations such as offline squeezing and single-mode measurements. It is shown that these in conjunction with a non-Gaussian element allow for universal quantum computatio…
Many proposals for fault tolerant quantum computation (FTQC) suffer detectable loss processes. Here we show that topological FTQC schemes, which are known to have high error thresholds, are also extremely robust against losses. We demonstrate that these schemes tolerate loss rates up to 24.9%, determined by bond percolation on a cubic lattice. Our numerical results show that these schemes retain good performance when loss and computational errors are simultaneously present.
From a rigorous multichannel quantum-defect formulation of bimolecular processes, we derive a fully quantal and analytic model for the total rate of exoergic bimolecular reactions and/or inelastic processes that is applicable over a wide range of temperatures including the ultracold regime. The theory establishes a connection between the ultracold chemistry and the regular chemistry by showing that the same theory that gives the quantum threshold behavior agrees with the classical Gorin model at higher temperatures. In between, it predicts that the rates for identical bosonic molecules and dis…
The spin-3/2 Affleck-Kennedy-Lieb-Tasaki (AKLT) valence-bond state on the hexagonal lattice was shown to be a universal resource state for measurement-based quantum computation (MBQC). Can AKLT states of higher spin magnitude support universal MBQC? We demonstrate that several hybrid 2D AKLT states involving mixture of spin-2 and other lower-spin entities, such as spin-3/2 and spin-1, are also universal for MBQC. This significantly expands universal resource states in the AKLT family. Even though frustration may be a hinderance to quantum computational universality, lattices can be modified to…
We use one photon to simulate an n-qubit quantum system for the first time. We propose a new scheme to realize universal quantum computation in polynomial time O(n^5). A generating set of gates can be realized with high accuracy in the lab. We conclude that photonic quantum computation is one of the promising approaches to universal quantum computation.
We prove that the theorems of TDDFT can be applied to a class of qubit Hamiltonians that are universal for quantum computation. The theorems of TDDFT applied to universal Hamiltonians imply that single-qubit expectation values can be used as the basic variables in quantum computation and information theory, rather than wavefunctions. From a practical standpoint this opens the possibility of approximating observables of interest in quantum computations directly in terms of single-qubit quantities (i.e. as density functionals). Additionally, we also demonstrate that TDDFT provides an exact presc…
We show that braidings of the metaplectic anyons $X_ε$ in $SO(3)_2=SU(2)_4$ with their total charge equal to the metaplectic mode $Y$ supplemented with measurements of the total charge of two metaplectic anyons are universal for quantum computation. We conjecture that similar universal computing models can be constructed for all metaplectic anyon systems $SO(p)_2$ for any odd prime $p\geq 5$. In order to prove universality, we find new conceptually appealing universal gate sets for qutrits and qupits.
