Related papers: Symmetry Protected Quantum Computation
Quantum computing tries to exploit entanglement and interference to process information more efficiently than the best known classical solutions. Experiments demonstrating the feasibility of this approach have already been performed.…
We investigate how to carry out universal quantum computation deterministically with free electrons in decoherence-free subspace by using polarizing beam splitters, charge detectors, and single-spin rotations. Quantum information in our…
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…
In circuit-based quantum computing, the available gate set typically consists of single-qubit gates acting on each individual qubit and at least one entangling gate between pairs of qubits. In certain physical architectures, however, some…
Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…
We study the protective measurement of a qubit by a second qubit acting as a probe. Consideration of this model is motivated by the possibility of its experimental implementation in multiqubit systems such as trapped ions. In our scheme,…
We produce and holographically measure entangled qudits encoded in transverse spatial modes of single photons. With the novel use of a quantum state tomography method that only requires two-state superpositions, we achieve the most complete…
This article is a short introduction to and review of the cluster-state model of quantum computation, in which coherent quantum information processing is accomplished via a sequence of single-qubit measurements applied to a fixed quantum…
Consider the model of computation where we start with two halves of a $2n$-qubit maximally entangled state. We get to apply a universal quantum computation on one half, measure both halves at the end, and perform classical postprocessing.…
The notion of symmetry is shown to be at the heart of all error correction/avoidance strategies for preserving quantum coherence of an open quantum system S e.g., a quantum computer. The existence of a non-trivial group of symmetries of the…
Every quantum state can be represented as a probability distribution over the outcomes of an informationally complete measurement. But not all probability distributions correspond to quantum states. Quantum state space may thus be thought…
Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary…
Usually models for quantum computations deal with unitary gates on pure states. In this paper we generalize the usual model. We consider a model of quantum computations in which the state is an operator of density matrix and the gates are…
Quantum computers have the potential to solve certain interesting problems significantly faster than classical computers. To exploit the power of a quantum computation it is necessary to perform inter-qubit operations and generate entangled…
Many promising ideas for quantum computing demand the experimental ability to directly switch 'on' and 'off' a physical coupling between the component qubits. This is typically the key difficulty in implementation, and precludes quantum…
While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable…
We review the theoretical aspects of pseudospin quantum computation using vertically coupled quantum dots in the quantum Hall regime. We discuss the robustness and addressability of these collective, charge-based qubits. The low energy…
Parity measurements on qubits can generate the entanglement resource necessary for scalable quantum computation. Here we describe a method for fast optical parity measurements on electron spin qubits within coupled quantum dots. The…
Among the surprising features of quantum measurements, the problem of distinguishing and antidistinguishing general quantum measurements is fundamentally appealing. Unlike classical systems, quantum theory offers entangled states and…