A logical qubit is a two-dimensional subspace of a higher dimensional system, chosen such that it is possible to detect and correct the occurrence of certain errors. Manipulation of the encoded information generally requires arbitrary and precise control over the entire system. Whether based on multiple physical qubits or larger dimensional modes such as oscillators, the individual elements in realistic devices will always have residual interactions which must be accounted for when designing logical operations. Here we demonstrate a holistic control strategy which exploits accurate knowledge of the Hamiltonian to manipulate a coupled oscillator-transmon system. We use this approach to realize high-fidelity (99%, inferred), decoherence-limited operations on a logical qubit encoded in a superconducting cavity resonator using four-component cat states. Our results show the power of applying numerical techniques to control linear oscillators and pave the way for utilizing their large Hilbert space as a resource in quantum information processing.
Large-scale universal quantum computing requires the implementation of quantum error correction (QEC). While the implementation of QEC has already been demonstrated for quantum memories, reliable quantum computing requires also the application of nontrivial logical gate operations to the encoded qubits. Here, we present examples of such operations by implementing, in addition to the identity operation, the NOT and the Hadamard gate to a logical qubit encoded in a five qubit system that allows correction of arbitrary single qubit errors. We perform quantum process tomography of the encoded gate…
We show how to carry out quantum logical operations (controlled-not and Toffoli gates) on encoded qubits for several encodings which protect against various 1-bit errors. This improves the reliability of these operations by allowing one to correct for one bit errors which either preexisted or occurred in course of operation. The logical operations we consider allow one to cary out the vast majority of the steps in the quantum factoring algorithm. Thus, our results help bring quantum factoring and other quantum computations closer to reality
We propose a proof-of-principle experiment to encode one logical qubit in noise protected subspace of three identical spins in a methyl group. The symmetry analysis of the wavefunction shows that this fermionic system exhibits a symmetry correlation between the spatial degree of freedom and the spin degree of freedom. We show that one can use this correlation to populate the noiseless subsystem by relying on the interaction between the electric dipole moment of the methyl group with a circularly polarized microwave field. Logical gates are implemented by controlling both the intensity and phas…
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…
Implementing spatially-encoded universal linear multiport interferometers on integrated photonic platforms with high controllability becomes increasingly difficult as the number of modes increases. In this work, we consider an architecture in which temporally-encoded modes are injected into a chain of reconfigurable beamsplitters and delay loops, and provide a detailed loss analysis for this and other comparable architectures. This analysis also yields a straightforward and explicit description of the control sequence needed for implementing an arbitrary temporally-encoded transformation. We c…
I calculate the fidelity of a [7,1,3] CSS quantum error correction code logical zero state constructed in a non-equiprobable Pauli operator error environment for two methods of encoding. The first method is to apply fault tolerant error correction to an arbitrary state of 7 qubits utilizing Shor states for syndrome measurement. The Shor states are themselves constructed in the non-equiprobable Pauli operator error environment and their fidelity depends on the number of verifications done to ensure multiple errors will not propagate into the encoded quantum information. Surprisingly, performing…
Correlation-Assisted Odd-Parity Encoded Gates in Coupled Fluxonium Qubits under Non-Markovian TLS Noise
School of Physics, Hangzhou Dianzi University（杭州电子科技大学物理学院）；State Key Laboratory of Quantum Optics Technologies and Devices, Shanxi University（山西大学量子光学技术与器件国家重点实验室）；Zhejiang Key Laboratory of Quantum State Control and Optical Field Manipulation, Hangzhou Dianzi University（杭州电子科技大学量子态调控与光场操纵浙江省重点实验室）
Future quantum computers will require quantum error correction for faithful operation. The correction capabilities come with an overhead for performing fault-tolerant logical operations on the encoded qubits. One of the most resource efficient ways to implement logical operations is lattice surgery, where groups of physical qubits, arranged on lattices, can be merged and split to realize entangling gates and teleport logical information. Here, we report on the experimental realization of lattice surgery between two topologically encoded qubits in a 10-qubit ion trap quantum information process…
We propose an effective realization of the universal set of elementary quantum gates in solid state quantum computer based on macroscopic (or mesoscopic) resonance systems - multi-atomic coherent ensembles, squids or quantum dots in quantum electrodynamic cavity. We exploit an encoding of logical qubits by the pairs of the macroscopic two- or three-level atoms that is working in a Hilbert subspace of all states inherent to these atomic systems. In this subspace, logical single qubit gates are realized by the controlled reversible transfer of single atomic excitation in the pair via the exchang…
Continuous-variable (CV) systems are attracting increasing attention in the realization of universal quantum computation. Several recent experiments have shown the feasibility of using CV systems to, e.g., encode a qubit into a trapped-ion mechanical oscillator and perform logic gates [Nature 566, 513-517 (2019)]. The essential next step is to protect the encoded qubit from quantum decoherence, e.g., the motional decoherence due to the interaction between a mechanical oscillator and its environment. Here we propose a scheme to suppress quantum decoherence of a single-mode harmonic oscillator u…
Whenever a mathematical proposition to be proved requires more information than it is contained in an axiomatic system, it can neither be proved nor disproved, i.e. it is undecidable, or logically undetermined, within this axiomatic system. I will show that certain mathematical propositions on a d-valent function of a binary argument can be encoded in d-dimensional quantum states of mutually unbiased basis (MUB) sets, and truth values of the propositions can be tested in MUB measurements. I will then show that a proposition is undecidable within the system of axioms encoded in the state, if an…
We show that, for any n > 0, the Heisenberg interaction among 2n qubits (as spin-1/2 particles) can be used to exactly implement an n-qubit parity gate, which is equivalent in constant depth to an n-qubit fanout gate. Either isotropic or nonisotropic versions of the interaction can be used. We generalize our basic results by showing that any Hamiltonian (acting on suitably encoded logical qubits), whose eigenvalues depend quadratically on the Hamming weight of the logical qubit values, can be used to implement generalized Mod_q gates for any q > 1. This paper is a sequel to quant-ph/0309163, a…
A fundamental question in the theory of quantum computation is to understand the ultimate space-time resource costs for performing a universal set of logical quantum gates to arbitrary precision. Here we demonstrate that non-Abelian anyons in Turaev-Viro quantum error correcting codes can be moved over a distance of order the code distance, and thus braided, by a constant depth local unitary quantum circuit followed by a permutation of qubits. Our gates are protected in the sense that the length of error strings do not grow by more than a constant factor. When applied to the Fibonacci code, ou…
To realize fault-tolerant quantum computing, it is necessary to store quantum information in logical qubits with error correction functions, realized by distributing a logical state among multiple physical qubits or by encoding it in the Hilbert space of a high-dimensional system. Quantum gate operations between these error-correctable logical qubits, which are essential for implementation of any practical quantum computational task, have not been experimentally demonstrated yet. Here we demonstrate a geometric method for realizing controlled-phase gates between two logical qubits encoded in p…
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…
A non-Clifford gate is required for universal quantum computation, and, typically, this is the most error-prone and resource intensive logical operation on an error-correcting code. Small, single-qubit rotations are popular choices for this non-Clifford gate, but certain three-qubit gates, such as Toffoli or controlled-controlled-Z (CCZ), are equivalent options that are also more suited for implementing some quantum algorithms, for instance those with coherent classical subroutines. Here, we calculate error rates and resource overheads for implementing logical CCZ with pieceable fault-toleranc…
We investigate a scheme of fault-tolerant quantum computation based on the cluster model. Logical qubits are encoded by a suitable code such as the Steane's 7-qubit code. Cluster states of logical qubits are prepared by post-selection through verification at high fidelity level, where the unsuccessful ones are discarded without recovery operation. Then, gate operations are implemented by transversal measurements on the prepared logical cluster states. The noise threshold is improved significantly by making the high fidelity preparation and transversal measurement. It is estimated to be about 3…
The implementation of logical operations on polarization-encoded x-rays via resonant light-nucleus interactions is theoretically investigated. We show that by means of resonant scattering off nuclei and fast rotations of the nuclear hyperfine magnetic field to control the polarization of the output photon, single-qubit logical gates can be simulated. A second control qubit may be employed to trigger the magnetic field rotation, thus allowing several implementation choices for a controlled NOT gate for x-ray photons.
The universal quantum cloning machine and the universal NOT gate acting on a single qubit can be implemented very generally by slightly modifying the protocol of quantum state teleportation. The experimental demonstration of the 1 to 2 cloning process according to the above scheme has been realized for a qubit encoded in photon polarization.
Entangling gates between qubits are a crucial component for performing algorithms in quantum computers. However, any quantum algorithm must ultimately operate on error-protected logical qubits encoded in high-dimensional systems. Typically, logical qubits are encoded in multiple two-level systems, but entangling gates operating on such qubits are highly complex and have not yet been demonstrated. Here, we realize a controlled NOT (CNOT) gate between two multiphoton qubits in two microwave cavities. In this approach, we encode a qubit in the high-dimensional space of a single cavity mode, rathe…
A class of architectures is advanced for cluster state quantum computation using quantum dots. These architectures include using single and multiple dots as logical qubits. Special attention is given to the supercoherent qubits introduced by Bacon, Brown, and Whaley [Phys. Rev. Lett. {\bf 87}, 247902 (2001)] for which we discuss the effects of various errors, and present means of error protection.
We compare two different implementations of fault-tolerant entangling gates on logical qubits. In one instance, a twelve-qubit trapped-ion quantum computer is used to implement a non-transversal logical CNOT gate between two five qubit codes. The operation is evaluated with varying degrees of fault tolerance, which are provided by including quantum error correction circuit primitives known as flagging and pieceable fault tolerance. In the second instance, a twenty-qubit trapped-ion quantum computer is used to implement a transversal logical CNOT gate on two [[7,1,3]] color codes. The two codes…
When the environmental disturbace to a quantum system has a wavelength much larger than the system size, all qubits localized within a small area are under action of the same error operators. Noiseless subsystem and decoherence free subspace are known to correct such collective errors. We construct simple quantum circuits, which implement these collective error correction codes, for a small number $n$ of physical qubits. A single logical qubit is encoded with $n=3$ and $n=4$, while two logical qubits are encoded with $n=5$. The recursive relations among the subspaces employed in noiseless subs…
We demonstrate coherent control of two logical qubits encoded in a decoherence free subspace (DFS) of four dipolar-coupled protons in an NMR quantum information processor. A pseudo-pure fiducial state is created in the DFS, and a unitary logical qubit entangling operator evolves the system to a logical Bell state. The four-spin molecule is partially aligned by a liquid crystal solvent, which introduces strong dipolar couplings among the spins. Although the system Hamiltonian is never fully specified, we demonstrate high fidelity control over the logical degrees of freedom. In fact, the DFS enc…
We show how an arbitrary qubit rotation can be teleported, albeit probabilistically, using 1 e-bit of entanglement and one classical bit. We use this to present a scheme for implementing quantum secret sharing. The scheme operates essentially by sending a "secret" rotated qubit of information to several users, who need to cooperate in order to recover the original qubit.
A critical component of any quantum error-correcting scheme is detection of errors by using an ancilla system. However, errors occurring in the ancilla can propagate onto the logical qubit, irreversibly corrupting the encoded information. We demonstrate a fault-tolerant error-detection scheme that suppresses spreading of ancilla errors by a factor of 5, while maintaining the assignment fidelity. The same method is used to prevent propagation of ancilla excitations, increasing the logical qubit dephasing time by an order of magnitude. Our approach is hardware-efficient, as it uses a single mult…
The realization of quantum error correction is an essential ingredient for reaching the full potential of fault-tolerant universal quantum computation. Using a range of different schemes, logical qubits can be redundantly encoded in a set of physical qubits. One such scalable approach is based on the surface code. Here we experimentally implement its smallest viable instance, capable of repeatedly detecting any single error using seven superconducting qubits, four data qubits and three ancilla qubits. Using high-fidelity ancilla-based stabilizer measurements we initialize the cardinal states o…
Here, we numerically simulate probabilistic elementary entangling operations between rail-encoded photons for the purpose of scalable universal quantum computation or communication. We propose grouping logical qubits into single-photon blocks wherein single-qubit rotations and the CNOT gate are fully deterministic and simple to implement. Inter-block communication is then allowed through said probabilistic entangling operations. We find a promising trend in the increasing probability of successful inter-block communication as we increase the number of optical modes operated on by our elementar…
Quantum bits are more robust to noise when they are encoded non-locally. In such an encoding, errors affecting the underlying physical system can then be detected and corrected before they corrupt the encoded information. In 2001, Gottesman, Kitaev and Preskill (GKP) proposed a hardware-efficient instance of such a qubit, which is delocalised in the phase-space of a single oscillator. However, implementing measurements that reveal error syndromes of the oscillator while preserving the encoded information has proved experimentally challenging: the only realisation so far relied on post-selectio…
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 analyse a generalised quantum error correction code against photon loss where a logical qubit is encoded into a subspace of a single oscillator mode that is spanned by distinct multi-component cat states (coherent-state superpositions). We present a systematic code construction that includes the extension of an existing one-photon-loss code to higher numbers of losses. When subject to a photon loss (amplitude damping) channel, the encoded qubits are shown to exhibit a cyclic behaviour where the code and error spaces each correspond to certain multiples of losses, half of which can be correc…
Binary quantum information can be fault tolerantly encoded in states defined in infinite dimensional Hilbert spaces. Such states define a computational basis, and permit a perfect equivalence between continuous and discrete universal operations. The drawback of this encoding is that the corresponding logical states are unphysical, meaning infinitely localized in phase space. We use the modular variables formalism to show that, in a number of protocols relevant for quantum information and for the realization of fundamental tests of quantum mechanics, it is possible to loosen the requirements on…
Universal quantum computation is striking for its unprecedented capability in processing information, but its scalability is challenging in practice because of the inevitable environment noise. Although quantum error correction (QEC) techniques have been developed to protect stored quantum information from leading orders of errors, the noise-resilient processing of the QEC-protected quantum information is highly demanded but remains elusive. Here, we demonstrate phase gate operations on a logical qubit encoded in a bosonic oscillator in an error-transparent (ET) manner. Inspired by Refs. [9,10…
Fault-tolerant logical operations for qubits encoded by CSS codes are discussed, with emphasis on methods that apply to codes of high rate, encoding k qubits per block with k>1. It is shown that the logical qubits within a given block can be prepared by a single recovery operation in any state whose stabilizer generator separates into X and Z parts. Optimized methods to move logical qubits around and to achieve controlled-not and Toffoli gates are discussed. It is found that the number of time-steps required to complete a fault-tolerant quantum computation is the same when k>1 as when k=1.
A quantum computer has the potential to effciently solve problems that are intractable for classical computers. Constructing a large-scale quantum processor, however, is challenging due to errors and noise inherent in real-world quantum systems. One approach to this challenge is to utilize modularity--a pervasive strategy found throughout nature and engineering--to build complex systems robustly. Such an approach manages complexity and uncertainty by assembling small, specialized components into a larger architecture. These considerations motivate the development of a quantum modular architect…
We present Monte Carlo wavefunction simulations for quantum computations employing an exchange-coupled array of quantum dots. Employing a combination of experimentally and theoretically available parameters, we find that gate fidelities greater than 98 % may be obtained with current experimental and technological capabilities. Application to an encoded 3 qubit (nine physical qubits) Deutsch-Josza computation indicates that the algorithmic fidelity is more a question of the total time to implement the gates than of the physical complexity of those gates.
Quantum error correcting codes protect quantum computation from errors caused by decoherence and other noise. Here we study the problem of designing logical operations for quantum error correcting codes. We present an automated procedure which generates logical operations given known encoding and correcting procedures. Our technique is to use variational circuits for learning both the logical gates and the physical operations implementing them. This procedure can be implemented on near-term quantum computers via quantum process tomography. It enables automatic discovery of logical gates from a…
Fault-tolerant quantum computing demands many qubits with long lifetimes to conduct accurate quantum gate operations. However, external noise limits the computing time of physical qubits. Quantum error correction codes may extend such limits, but imperfect gate operations introduce errors to the correction procedure as well. The additional gate operations required due to the physical layout of qubits exacerbate the situation. Here, we use density-matrix simulations to investigate the performance change of logical qubits according to quantum error correction codes and qubit layouts and the expe…
IonQ Inc.（IonQ公司）；QuICS, NIST/University of Maryland（量子信息与计算科学研究所，美国国家标准与技术研究院/马里兰大学）；UMIACS, University of Maryland（统一信息管理与计算系统研究所，马里兰大学）；Quantum Research Center, Technology Innovation Institute（量子研究中心，技术创新研究所）；Centre for Quantum Technologies, National University of Singapore（量子技术中心，新加坡国立大学）；Nanyang Quantum Hub, School of Physical and Mathematical Sciences, Nanyang Technological University（南洋量子枢纽，物理与数学科学学院，南洋理工大学）
