In this paper we investigate the linear and nonlinear models of optical quantum computation and discuss their scalability and efficiency. We show how there are significantly different scaling properties in single photon computation when weak cross-Kerr nonlinearities are allowed to supplement the usual linear optical set. In particular we show how quantum non-demolition measurements are an efficient resource for universal quantum computation.
We discuss the characterization and properties of quantum non-demolition (QND) measurements on qubit systems. We introduce figures of merit which can be applied to systems of any Hilbert space dimension thus providing universal criteria for characterizing QND measurements. We discuss the controlled-NOT gate and an optical implementation as examples of QND devices for qubits. We also discuss the QND measurement of weak values.
We present a quantum circuit that implements a non-demolition measurement of complementary single- and bi-partite properties of a two-qubit system: entanglement and single-partite visibility and predictability. The system must be in a pure state with real coefficients in the computational basis, which allows a direct operational interpretation of those properties. The circuit can be realized in many systems of interest to quantum information.
Quantum non-demolition measurements as a practical primitive for fault-tolerant computation against biased noise
Alice & Bob（爱丽丝与鲍勃公司）；Laboratoire de Physique de l’École Normale Supérieure, École Normale Supérieure, Centre Automatique et Systèmes, Mines Paris, Université PSL, CNRS, Inria（巴黎高等师范学院物理实验室，巴黎高等师范学院，自动系统与矿业学院，巴黎高等矿业学院，PSL大学，法国国家科学研究中心，法国国家信息与自动化研究所）
An adiabatic method for a single-shot non-demolition measurement of the phase qubit is suggested. The qubit is inductively coupled to a low-frequency resonator, which in turn is connected with a classical measurement device (phase meter). The resonator drives adiabatic oscillations of the supercurrent in the qubit loop. The back reaction of the qubit loop on the resonator depends on the qubit state. Measuring the phase shift of the resonator's oscillations one can determine the state of the qubit. Numerical computations with available experimental parameters show that the phase difference betw…
We simply construct a quantum universal variable-length source code in which, independent of information source, both of the average error and the probability that the coding rate is greater than the entropy rate $H(rho_p)$, tend to 0. If $H(rho_p)$ is estimated, we can compress the coding rate to the admissible rate $H(rho_p)$ with a probability close to 1. However, when we perform a naive measurement for the estimation of $H(rho_p)$, the input state is demolished. By smearing the measurement, we successfully treat the trade-off between the estimation of $H(rho_p)$ and the non-demolition of t…
We present a scheme for correcting qubit loss error while quantum computing with neutral atoms in an addressable optical lattice. The qubit loss is first detected using a quantum non-demolition measurement and then transformed into a standard qubit error by inserting a new atom in the vacated lattice site. The logical qubit, encoded here into four physical qubits with the Grassl-Beth-Pellizzari code, is reconstructed via a sequence of one projective measurement, two single-qubit gates, and three controlled-NOT operations. No ancillary qubits are required. Both quantum non-demolition and projec…
Quantum information processing (QIP) offers the promise of being able to do things that we cannot do with conventional technology. Here we present a new route for distributed optical QIP, based on generalized quantum non-demolition measurements, providing a unified approach for quantum communication and computing. Interactions between photons are generated using weak non-linearities and intense laser fields--the use of such fields provides for robust distribution of quantum information. Our approach requires only a practical set of resources, and it uses these very efficiently. Thus it promise…
This is a collection of references (papers, books, preprints, book reviews, Ph. D. thesis, patents, web sites, etc.), sorted alphabetically and (some of them) classified by subject, on foundations of quantum mechanics and quantum information. Specifically, it covers hidden variables (``no-go'' theorems, experiments), interpretations of quantum mechanics, entanglement, quantum effects (quantum Zeno effect, quantum erasure, ``interaction-free'' measurements, quantum ``non-demolition'' measurements), quantum information (cryptography, cloning, dense coding, teleportation), and quantum computation…
We show that free-space diffraction of photons distributes highly useful entanglement: the receivers of the propagated modes can do a distributed quantum computation using only linear optics and photon counting. The distributed computation requires classical communication between receivers, however, similar to standard measurement-based computation, that communication is of purely random outcomes and so can be indistinguishable from noise. The speculation in the title arises from the further observation that the natural way for a circumspect civilization to hide their photonic entanglement dis…
Future quantum computers capable of solving relevant problems will require a large number of qubits that can be operated reliably. However, the requirements of having a large qubit count and operating with high-fidelity are typically conflicting. Spins in semiconductor quantum dots show long-term promise but demonstrations so far use between one and four qubits and typically optimize the fidelity of either single- or two-qubit operations, or initialization and readout. Here we increase the number of qubits and simultaneously achieve respectable fidelities for universal operation, state prepara…
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.
It is shown that efficient and robust universal quantum computation is possible using the stimulated Raman adiabatic passage with a qubit chain as a pointer register.
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.
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 show how to perform reversible universal quantum computation on a translationally invariant pure state, using only global operations based on next-neighbor interactions. We do not need not to break the translational symmetry of the state at any time during the computation. Since the proposed scheme fulfills the locality condition of a quantum cellular automata, we present a reversible quantum cellular automaton capable of universal quantum computation.
We present a formulation for investigating quench dynamics across quantum phase transitions in the presence of decoherence. We formulate decoherent dynamics induced by continuous quantum non-demolition measurements of the instantaneous Hamiltonian. We generalize the well-studied universal Kibble-Zurek behavior for linear temporal drive across the critical point. We identify a strong decoherence regime wherein the decoherence time is shorter than the standard correlation time, which varies as the inverse gap above the groundstate. In this regime, we find that the freeze-out time $\bar{t}\simτ^{…
I describe a quantum cellular automaton capable of performing universal quantum computation. The automaton has an elementary transition function that acts on Margolus cells of $2\times 2$ qubits, and both the ``quantum input'' and the program are encoded in the initial state of the system.
What resources are universal for quantum computation? In the standard model, a quantum computer consists of a sequence of unitary gates acting coherently on the qubits making up the computer. This paper shows that a very different model involving only projective measurements, quantum memory, and the ability to prepare the |0> state is also universal for quantum computation. In particular, no coherent unitary dynamics are involved in the computation.
We investigate which entanglement resources allow universal measurement-based quantum computation via single-qubit operations. We find that any entanglement feature exhibited by the 2D cluster state must also be present in any other universal resource. We obtain a powerful criterion to assess universality of graph states, by introducing an entanglement measure which necessarily grows unboundedly with the system size for all universal resource states. Furthermore, we prove that graph states associated with 2D lattices such as the hexagonal and triangular lattice are universal, and obtain the fi…
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…
Recently de La Torre et al. [1] reconstructed Quantum Theory from its local structure on the basis of local discriminability and the existence of a one-parameter group of bipartite transformations containing an entangling gate. This result relies on universality of an entangling gate for quantum computation. Here we prove universality of C-NOT with local gates for Real Quantum Theory (RQT), showing that such universality would not be sufficient for the result, whereas local discriminability and the qubit structure play a crucial role. For reversible computation, generally an extra rebit is nee…
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--…
In some of the earliest work on quantum mechanical computers, Feynman showed how to implement universal quantum computation by the dynamics of a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be a sparse matrix with all entries equal to 0 or 1, i.e., the adjacency matrix of a low-degree graph. Thus quantum walk can be regarded as a universal computational primitive, with any desired quantum computation encoded entirely in some underlying graph. The main idea of the construction is to implement quantum gates by scattering processes.
We prove the existence of a class of two--input, two--output gates any one of which is universal for quantum computation. This is done by explicitly constructing the three--bit gate introduced by Deutsch [Proc.~R.~Soc.~London.~A {\bf 425}, 73 (1989)] as a network consisting of replicas of a single two--bit gate.
We consider topological quantum memories for a general class of abelian anyon models defined on spin lattices. These are non-universal for quantum computation when restricting to topological operations alone, such as braiding and fusion. The effects of additional non-topological operations, such as spin measurements, are studied. These are shown to allow universal quantum computation, while still utilizing topological protection. Our work gives an insight into the relation between abelian models and their non-abelian counterparts.
Matchgates are a family of two-qubit gates associated with noninteracting fermions. They are classically simulatable if acting only on nearest neighbors, but become universal for quantum computation if we relax this restriction or use SWAP gates [Jozsa and Miyake, Proc. R. Soc. A 464, 3089 (2008)]. We generalize this result by proving that any nonmatchgate parity-preserving unitary is capable of extending the computational power of matchgates into universal quantum computation. We identify the single local invariant of parity-preserving unitaries responsible for this, and discuss related resul…
The quantum approximate optimization algorithm (QAOA) applies two Hamiltonians to a quantum system in alternation. The original goal of the algorithm was to drive the system close to the ground state of one of the Hamiltonians. This paper shows that the same alternating procedure can be used to perform universal quantum computation: the times for which the Hamiltonians are applied can be programmed to give a computationally universal dynamics. The Hamiltonians required can be as simple as homogeneous sums of single-qubit Pauli X's and two-local ZZ Hamiltonians on a one-dimensional line of qubi…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H(λ)$ that is based on ground state quantum computation [1]. We treat both a 1-dimensional configuration in which qubits on a line undergo nearest neighbor 2-qubit gates and an all-to-all configuration in which every qubit undergoes 2-qubit gates with every other qubit in the system.
We show how to control and perform universal three-qubit quantum computation with trapped electron quantum states. The three qubits are the electron spin, and the first two quantum states of the cyclotron and axial harmonic oscillators. We explicitly show how the universal gates can be performed. As an example of a non-trivial quantum algorithm, we outline the implementation of the Deutsch-Jozsa algorithm in this system.
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In order to formalize these other forms of computation, while pointing out the role and the necessity of classical control in measurement-based computation, and for establishing a new upper bound of the minimal resources needed to quantum universality, a formal model is introduced by means of Measurement-based Quantum Turing Machines.
What additional gates are needed for a set of classical universal gates to do universal quantum computation? We answer this question by proving that any single-qubit real gate suffices, except those that preserve the computational basis. The result of Gottesman and Knill[quant-ph/9807006] implies that any quantum circuit involving only the Controlled-NOT and Hadamard gates can be efficiently simulated by a classical circuit. In contrast, we prove that Controlled-NOT plus any single-qubit real gate that does not preserve the computational basis and is not Hadamard (or its alike) are universal f…
We give a cheat sensitive protocol for blind universal quantum computation that is efficient in terms of computational and communication resources: it allows one party to perform an arbitrary computation on a second party's quantum computer without revealing either which computation is performed, or its input and output. The first party's computational capabilities can be extremely limited: she must only be able to create and measure single-qubit superposition states. The second party is not required to use measurement-based quantum computation. The protocol requires the (optimal) exchange of …
Nonadiabatic holonomic quantum computation as one of the key steps to achieve fault tolerant quantum information processing has so far been realized in a number of physical settings. However, in some physical systems particularly in spin qubit systems, which are actively considered for realization of quantum computers, experimental challenges are undeniable and the lack of a practically feasible and scalable scheme that supports universal holonomic quantum computation all in a single well defined setup is still an issue. Here, we propose and discuss a scalable star-shape architecture with prom…
We show that the quantum dimer state on the Kagome lattice, which was recently realized with high fidelity in a Rydberg quantum simulator [Semeghini et al., Science 374, 6572 (2021)], offers a sufficient resource for universal measurement-based quantum computations. In particular, we provide an efficient encoding of logical qubits in this state, and give explicit measurement sequences that implement a universal set of gates on these qubits. Since the building blocks of the proposed measurements have already been experimentally implemented, our work highlights one possible path towards promotin…
Matchgates are a group of two-qubit gates associated with free fermions. They are classically simulatable if restricted to act between nearest neighbors on a one-dimensional chain, but become universal for quantum computation with longer-range interactions. We describe various alternative geometries with nearest-neighbor interactions that result in universal quantum computation with matchgates only, including subtle departures from the chain. Our results pave the way for new quantum computer architectures that rely solely on the simple interactions associated with matchgates.
We introduce a scheme to perform universal quantum computation in quantum cellular automata (QCA) fashion in arbitrary subsystem dimension (not necessarily finite). The scheme is developed over a one spatial dimension $N$-element array, requiring only mirror symmetric logical encoding and global pulses. A mechanism using ancillary degrees of freedom for subsystem specific measurement is also presented.
Nielsen [quant-ph/0108020] showed that universal quantum computation is possible given quantum memory and the ability to perform projective measurements on up to 4-qubits. We describe an improved method that requires only 2-qubit measurements, which are both sufficient and necessary. We present a method to partially collapse the $C_k$-hierarchy in the indirect construction of unitary gates [Gottesman and Chuang, Nature, {\bf 402} 309 (1999)], and apply the method to find discrete universal sets of 2-qubit measurements.
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In order to formalize these other forms of computation, while pointing out the role and the necessity of classical control in measurement-based computation, and for establishing a new upper bound of the minimal resources needed to quantum universality, a formal model is introduced by means of Measurement-based Quantum Turing Machines.
Although universal continuous-variable quantum computation cannot be achieved via linear optics (including squeezing), homodyne detection and feed-forward, inclusion of ideal photon counting measurements overcomes this obstacle. These measurements are sometimes described by arrays of beam splitters to distribute the photons across several modes. We show that such a scheme cannot be used to implement ideal photon counting and that such measurements necessarily involve nonlinear evolution. However, this requirement of nonlinearity can be moved "off-line," thereby permitting universal continuous-…
We present universal continuous variable quantum computation (CVQC) in the micromaser. With a brief history as motivation we present the background theory and define universal CVQC. We then show how to generate a set of operations in the micromaser which can be used to achieve universal CVQC. It then follows that the micromaser is a potential architecture for CVQC but our proof is easily adaptable to other potential physical systems.
We show that universal quantum logic can be achieved using only linear optics and a quantum shutter device. With these elements, we design a quantum memory for any number of qubits and a CNOT gate which are the basis of a universal quantum computer. An interaction-free model for a quantum shutter is given.
We present a constructive proof that anyonic magnetic charges with fluxes in a non-solvable finite group can perform universal quantum computations. The gates are built out of the elementary operations of braiding, fusion, and vacuum pair creation, supplemented by a reservoir of ancillas of known flux. Procedures for building the ancilla reservoir and for correcting leakage are also described. Finally, a universal qudit gate-set, which is ideally suited for anyons, is presented. The gate-set consists of classical computation supplemented by measurements of the X operator.
We consider the problem of minimizing resources required for universal quantum computation using only projective measurements. The resources we focus on are observables, which describe projective measurements, and ancillary qubits. We show that the set of observables {Z \otimes X, (cosθ)X + (sinθ)Y all θ\in [0, 2π)} with one ancillary qubit is universal for quantum computation. The set is simpler than a previous one in the sense that one-qubit projective measurements described by the observables in the set are ones only in the (X,Y) plane of the Bloch sphere. The proof of the universality imme…
Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It is shown next, how for quantum computation with qubits can be used two-dimensional analog of this Cayley-Weyl matrix algebras, i.e. Clifford algebras, and discussed well known applications to product operator formalism in NMR, Jordan-Wigner construction in fermionic quantum computations. It is introduced universal set of quantum gates for higher dimensional s…
We investigate the possibility to have electron-pairs in dephasing-free subspace (DFS), by means of the quantum-dot cellular automata (QCA) and single-spin rotations, to carry out a high-fidelity and deterministic universal quantum computation. We show that our QCA device with electrons tunneling two dimensionally is very suitable for DFS encoding, and argue that our design favors a scalable quantum computation robust to collective dephasing errors.
The promise of tremendous computational power, coupled with the development of robust error-correcting schemes, has fuelled extensive efforts to build a quantum computer. The requirements for realizing such a device are confounding: scalable quantum bits (two-level quantum systems, or qubits) that can be well isolated from the environment, but also initialized, measured and made to undergo controllable interactions to implement a universal set of quantum logic gates. The usual set consists of single qubit rotations and a controlled-NOT (CNOT) gate, which flips the state of a target qubit condi…
A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results in universal quantum computing. Motivated by the latter, we pose the following question: can one perform universal quantum computation by supplementing a set of classical gates with a quantum control, and a set of quantum gates operating solely on the latter? In this work we provide an affirmative answer to this question by considering a computational model …
We show that every quantum computation can be described by Bayesian update of a probability distribution on a finite state space. When applied to the model of quantum computation with magic states, the size of this state space only depends on the number of magic states used in the quantum computation, and not on the length of the gate and measurement sequence.
Blind quantum computation allows a client without enough quantum technologies to delegate her quantum computation to a remote quantum server, while keeping her input, output and algorithm secure. In this paper, we propose a universal single-server and almost-classical-client blind quantum computation protocol. In this protocol, the client interfaces with only one server and the only ability of the client required is to get particles from the trusted center and forward them to the server. We present an analysis of this protocol and modify it to a universal single-server and fully-classical-clie…
Transversal implementations of encoded unitary gates are highly desirable for fault-tolerant quantum computation. Though transversal gates alone cannot be computationally universal, they can be combined with specially distilled resource states in order to achieve universality. We show that "triorthogonal" stabilizer codes, introduced for state distillation by Bravyi and Haah [Phys. Rev. A 86 052329 (2012)], admit transversal implementation of the controlled-controlled-Z gate. We then construct a universal set of fault-tolerant gates without state distillation by using only transversal controll…
We present a nonlocal construction of universal gates by means of holonomic (geometric) quantum teleportation. The effect of the errors from imperfect control of the classical parameters, the looping variation of which builds up holonomic gates, is investigated. Additionally, the influence of quantum decoherence on holonomic teleportation used as a computational primitive is studied. Advantages of the holonomic implementation with respect to control errors and dissipation are presented.
