We present a theoretical analysis of the paradigm of encoded universality, using a Lie algebraic analysis to derive specific conditions under which physical interactions can provide universality. We discuss the significance of the tensor product structure in the quantum circuit model and use this to define the conjoining of encoded qudits. The construction of encoded gates between conjoined qudits is discussed in detail. We illustrate the general procedures with several examples from exchange-only quantum computation. In particular, we extend our earlier results showing universality with the isotropic exchange interaction to the derivation of encoded universality with the anisotropic exchange interaction, i.e., to the XY model. In this case the minimal encoding for universality is into qutrits rather than into qubits as was the case for isotropic (Heisenberg) exchange. We also address issues of fault-tolerance, leakage and correction of encoded qudits.
We propose an effective set of elementary quantum gates which provide an encoded universality and demonstrate the physical feasibility of these gates for the solid-state quantum computer based on the multi-atomic systems in the QED cavity. We use the two-qubit encoding and swapping-based operations to simplify a physical realization of universal quantum computing and add the immunity to a number of errors. This approach allows to implement any encoded single-qubit operation by three elementary gates and the encoded controlled- NOT operation can be performed in a single step. The considerable a…
We derive an encoded universality representation for a generalized anisotropic exchange Hamiltonian that contains cross-product terms in addition to the usual two-particle exchange terms. The recently developed algebraic approach is used to show that the minimal universality-generating encodings of one logical qubit are based on three physical qubits. We show how to generate both single- and two-qubit operations on the logical qubits, using suitably timed conjugating operations derived from analysis of the commutator algebra. The timing of the operations is seen to be crucial in allowing simpl…
We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the intrinsic ability of a system to act as a universal quantum computer using only its naturally available interactions. A key element of this approach is the realization that the fungible nature of quantum information allows for universal manipulations using quantum information encoded in a subspace of the full system Hilbert space, as an alternative to using physical…
Quantum computation can be performed by encoding logical qubits into the states of two or more physical qubits, and controlling a single effective exchange interaction and possibly a global magnetic field. This "encoded universality" paradigm offers potential simplifications in quantum computer design since it does away with the need to perform single-qubit rotations. Here we show that encoded universality schemes can be combined with quantum error correction. In particular, we show explicitly how to perform fault-tolerant leakage correction, thus overcoming the main obstacle to fault-tolerant…
We build a framework allowing for a systematic investigation of the issue: "Which quantum states are universal resources for one-way quantum computation?" We start by re-examining what is exactly meant by "universality" in quantum computation, and what the implications are for universal one-way quantum computation. Given the framework of a measurement-based quantum computer, where quantum information is processed by local operations only, the most general universal one-way quantum computer is one which is capable of accepting arbitrary classical inputs and producing arbitrary quantum outputs--…
The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit within an oscillator is particularly appealing for fault-tolerant quantum computing with bosons because Gaussian operations on encoded Pauli eigenstates enable Clifford quantum computing with error correction. We show that applying GKP error correction to Gaussian input states, such as vacuum, produces distillable magic states, achieving universality without additional non-Gaussian elements. Fault tolerance is possible with sufficient squeezing and low enough external noise. Thus, Gaussian operations are sufficient for fault-tolerant, uni…
An open problem of quantum information theory has been to determine under what conditions universal exchange-only computation is possible for qudits encoded on $d$-state systems for $d>2$. This problem can be posed in terms of representation theory by recognizing that each quantum mechanical swap, generated by exchange-interaction, can be identified with a transposition in a symmetric group, each $d$-state system can be identified with the fundamental representation of $SU(d)$, and each encoded qudit can be identified with an irreducible representation of a Lie algebra generated by transpositi…
Decoherence-induced leakage errors can couple a physical or encoded qubit to other levels, thus potentially damaging the qubit. They can therefore be very detrimental in quantum computation and require special attention. Here we present a general method for removing such errors by using simple decoupling and recoupling pulse sequences. The proposed gates are experimentally accessible in a variety of promising quantum computing proposals.
We construct a family of time-independent nearest-neighbor Hamiltonians coupling eight-state systems on a 1D ring that enables universal quantum computation. Hamiltonians in this family can achieve universality either by driving a continuous-time quantum walk or by terminating an adiabatic algorithm. In either case, the universality property can be understood as arising from an efficient simulation of a programmable quantum circuit. Using gadget perturbation theory, one can demonstrate the same kind of universality for related Hamiltonian families acting on qubits in 2D. Our results demonstrat…
Certain quantum codes allow logic operations to be performed on the encoded data, such that a multitude of errors introduced by faulty gates can be corrected. An important class of such operations are {\em transversal}, acting bitwise between corresponding qubits in each code block, thus allowing error propagation to be carefully limited. If any quantum operation could be implemented using a set of such gates, the set would be {\em universal}; codes with such a universal, transversal gate set have been widely desired for efficient fault-tolerant quantum computation. We study the structure of G…
Parafermions are Zn generalisations of Majorana quasiparticles, with fractional non-Abelian statistics. They can be used to encode topological qudits and perform Clifford operations by their braiding. We study the simplest case of the Z3 parafermion chain and investigate the form of the non-topological gate that arises through direct short-range interaction of the parafermion edge modes. We show that such an interaction gives rise to a dynamical phase gate on the encoded ground space, with the strongest order of the interaction generating a non-Clifford gate which can be tuned to belong to eve…
We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper definition of universality for computational components such as logic gates.
Transversal gates play an important role in the theory of fault-tolerant quantum computation due to their simplicity and robustness to noise. By definition, transversal operators do not couple physical subsystems within the same code block. Consequently, such operators do not spread errors within code blocks and are, therefore, fault tolerant. Nonetheless, other methods of ensuring fault tolerance are required, as it is invariably the case that some encoded gates cannot be implemented transversally. This observation has led to a long-standing conjecture that transversal encoded gate sets canno…
The Eastin-Knill theorem states that no quantum error correcting code can have a universal set of transversal gates. For CSS codes that can implement Clifford gates transversally it suffices to provide one additional non-Clifford gate, such as the T-gate, to achieve universality. Common methods to implement fault-tolerant T-gates like magic state distillation generate a significant hardware overhead that will likely prevent their practical usage in the near-term future. Recently methods have been developed to mitigate the effect of noise in shallow quantum circuits that are not protected by er…
I revisit the ideas underlying dynamical decoupling methods within the framework of quantum information processing, and examine their potential for direct implementations in terms of encoded rather than physical degrees of freedom. The usefulness of encoded decoupling schemes as a tool for engineering both closed- and open-system encoded evolutions is investigated based on simple examples.
We investigate effective noise channels for encoded quantum systems with and without active error correction. Noise acting on physical qubits forming a logical qubit is thereby described as a logical noise channel acting on the logical qubits, which leads to a significant decrease of the effective system dimension. This provides us with a powerful tool to study entanglement features of encoded quantum systems. We demonstrate this framework by calculating lower bounds on the lifetime of distillable entanglement and the negativity for encoded multipartite qubit states with different encodings. A…
We propose a projection measurement onto encoded Bell states with a static network of linear optical elements. By increasing the size of the quantum error correction code, both Bell measurement efficiency and photon-loss tolerance can be made arbitrarily high at the same time. As a main application, we show that all-optical quantum communication over large distances with communication rates similar to those of classical communication is possible solely based on local state teleportations using optical sources of encoded Bell states, fixed arrays of beam splitters, and photon detectors. As anot…
A single photon has many physical degrees of freedom (DOF) that can carry the state of a high-dimensional quantum system. Nevertheless, only a single DOF is usually used in any specific demonstration. Furthermore, when more DOF are being used, they are analyzed and measured one at a time. We introduce a two-qubit information system, realized by two degrees of freedom of a single photon: polarization and time. The photon arrival time is divided into two time-bins representing a qubit, while its polarization state represents a second qubit. The time difference between the two time-bins is create…
The future of quantum repeater networking will require interoperability between various error correcting codes. A few specific code conversions and even a generalized method are known, however, no detailed analysis of these techniques in the context of quantum networking has been performed. In this paper, we analyze a generalized procedure to create Bell pairs encoded heterogeneously between two separate codes used often in error corrected quantum repeater network designs. We begin with a physical Bell pair, then encode each qubit in a different error correcting code, using entanglement purifi…
Electron spins in semiconductor quantum dots are promising candidates for the experimental realization of solid-state qubits. We analyze the dynamics of a system of three qubits arranged in a linear geometry and a system of four qubits arranged in a square geometry. Calculations are performed for several quantum dot confining potentials. In the three-qubit case, three-body effects are identified that have an important quantitative influence upon quantum computation. In the four-qubit case, the full Hamiltonian is found to include both three-body and four-body interactions that significantly in…
As larger, higher-quality quantum devices are built and demonstrated in quantum information applications, such as quantum computation and quantum communication, the need for high-quality quantum memories to store quantum states becomes ever more pressing. Future quantum devices likely will use a variety of physical hardware, some being used primarily for processing of quantum information and others for storage. Here, we study the correlation of the structure of quantum information with physical noise models of various possible quantum memory implementations. Through numerical simulation of dif…
We study the quantum computational power of a generic class of anisotropic solid state Hamiltonians. A universal set of encoded logic operations are found which do away with difficult-to-implement single-qubit gates in a number of quantum computer proposals, e.g., quantum dots and donor atom spins with anisotropic exchange coupling, quantum Hall systems, and electrons floating on helium.We show how to make the corresponding Hamiltonians universal by encoding one qubit into two physical qubits, and by controlling nearest neighbor interactions.
It was shown by M.A. Nielsen and I.L. Chuang 1997, that it is impossible to build strictly universal programmable quantum gate array, that could perform any unitary operation precisely and it was suggested to use probabilistic gate arrays instead. In present work is shown, that if to use more physical and weak condition of universality (suggested already in earliest work by D.Deutsch 1985) and to talk about simulation with arbitrary, but finite precision, then it is possible to build universal programmable gate array. But now the same no-go theorem by Nielsen and Chuang will have new interesti…
Qubits are neither fermions nor bosons. A Fock space description of qubits leads to a mapping from qubits to parafermions: particles with a hybrid boson-fermion quantum statistics. We study this mapping in detail, and use it to provide a classification of the algebras of operators acting on qubits. These algebras in turn classify the universality of different classes of physically relevant qubit-qubit interaction Hamiltonians. The mapping is further used to elucidate the connections between qubits, bosons, and fermions. These connections allow us to share universality results between the diffe…
The principle of superposition is a key ingredient for quantum mechanics. A recent work [M. Oszmaniec et al., Phys. Rev. Lett. 116, 110403 (2016)] has shown that a quantum adder that deterministically generates a superposition of two unknown states is forbidden. Here we propose a probabilistic approach for creating a superposition state of two arbitrary states encoded in two three-dimensional cavities. Our implementation is based on a three-level superconducting transmon qubit dispersively coupled to two cavities. Numerical simulations show that high-fidelity generation of the superposition of…
Quantum computation promises applications that are thought to be impossible with classical computation. To realize practical quantum computation, the following three properties will be necessary: universality, scalability, and fault-tolerance. Universality is the ability to execute arbitrary multi-input quantum algorithms. Scalability means that computational resources such as logical qubits can be increased without requiring exponential increase in physical resources. Lastly, fault-tolerance is the ability to perform quantum algorithms in presence of imperfections and noise. A promising appro…
Manin, Feynman, and Deutsch have viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum logic circuits and quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a finite number of qubits. The problem of universality has been addressed most famously in a paper by Deutsch, and later by Bernstein and Vazirani as well as Kitaev and Solovay. The quantum logic circuit model, developed by Feynman and Deutsch, has been more prominent in the research literature than Deutsch's quantum Turing mach…
Quantum computation requires qubits that satisfy often-conflicting criteria, including scalable control and long-lasting coherence. One approach to creating a suitable qubit is to operate in an encoded subspace of several physical qubits. Though such encoded qubits may be particularly susceptible to leakage out of their computational subspace, they can be insensitive to certain noise processes and can also allow logical control with a single type of entangling interaction while maintaining favorable features of the underlying physical system. Here we demonstrate a qubit encoded in a subsystem …
Stabilizer code quantum Hamiltonians have been introduced with the intention of physically realizing a quantum memory because of their resilience to decoherence. In order to analyze their finite temperature thermodynamics, we show how to generically solve their partition function using duality techniques. By unveiling each model's universality class and effective dimension, insights may be gained on their finite temperature dynamics and robustness. Our technique is demonstrated in particular on the 4D Toric Code and Haah's Code -- we find that the former falls into the 4D Ising universality cl…
Local universality of non-local quantum resources in rotationally invariant scattering
InQubator for Quantum Simulation (IQuS) and Department of Physics, University of Washington（华盛顿大学量子模拟创新中心及物理系）；Institute for Quantum Information and Matter (IQIM) and Department of Physics, California Institute of Technology（加州理工学院量子信息与物质研究所及物理系）
The theory of continuous phase transitions predicts the universal collective properties of a physical system near a critical point, which for instance manifest in characteristic power-law behaviours of physical observables. The well-established concept at or near equilibrium, universality, can also characterize the physics of systems out of equilibrium. The most fundamental instance of a genuine non-equilibrium phase transition is the directed percolation universality class, where a system switches from an absorbing inactive to a fluctuating active phase. Despite being known for several decade…
Reliable quantum information processing in the face of errors is a major fundamental and technological challenge. Quantum error correction protects quantum states by encoding a logical quantum bit (qubit) in multiple physical qubits. To be compatible with universal fault-tolerant computations, it is essential that the states remain encoded at all times and that errors are actively corrected. Here we demonstrate such active error correction on a continuously protected qubit using a diamond quantum processor. We encode a logical qubit in three long-lived nuclear spins, repeatedly detect phase er…
The requirement of performing both single-qubit and two-qubit operations in the implementation of universal quantum logic often leads to very demanding constraints on quantum computer design. We show here how to eliminate the need for single-qubit operations in a large subset of quantum computer proposals: those governed by isotropic and XXZ,XY-type anisotropic exchange interactions. Our method employs an encoding of one logical qubit into two physical qubits, while logic operations are performed using an analogue of the NMR selective recoupling method.
A powerful strategy to accelerate quantum-walk-based search algorithms leverages on resetting protocols, where a detector monitors a target site and the evolution of the walker is restarted if no detection occurs within a fixed time interval. The optimal resetting rate can be extracted from the time evolution of the probability $S(t)$ that the detector has not clicked up to time $t$. We analyze $S(t)$ for a quantum walk on a one-dimensional lattice when the coupling between sites decays algebraically as $d^{-α}$ with the distance $d$, for $α\in(0,\infty)$. At long times, $S(t)$ decays with a u…
There are discernible and fundamental differences between clocks, waves and physical states in classical physics. These fundamental concepts find a common expression in the context of quantum physics in gravitational fields; matter and light waves, quantum states and oscillator clocks become quantum synonymous through the Planck-Einstein-de Broglie relations and the equivalence principle. With this insight, gravitational effects on quantum systems can be simply and accurately analyzed. Apart from providing a transparent framework for conceptual and quantitative thinking on matter waves and qua…
Interface phases and dynamics in two-dimensional quantum magnets: A "holographic" approach from universality to quantum simulation
The Rudolf Peierls Centre for Theoretical Physics, Oxford University（鲁道夫·派尔斯理论物理中心，牛津大学）；Harish-Chandra Research Institute (HRI)（哈里什-钱德拉研究所）；Homi Bhabha National Institute (HBNI)（霍米·巴巴国立研究所）；Institute for Theoretical Physics, KU Leuven（荷语鲁汶大学理论物理研究所）
Bosonic quantum field theories, even when regularized using a finite lattice, possess an infinite dimensional Hilbert space and, therefore, cannot be simulated in quantum computers with a finite number of qubits. A truncation of the Hilbert space is then needed and the physical results are obtained after a double limit: one to remove the truncation and another to remove the regulator (the continuum limit). A simpler alternative is to find a model with a finite dimensional Hilbert space belonging to the same universality class as the continuum model (a "qubitization"), so only the space continu…
