A 2 rebit gate universal for quantum computing

Abstract

We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact 2-rebit) gate which is universal for quantum computing, although it cannot be used to perform arbitrary unitary transformations.

2 pages

Cited by in corpus (22)

• Quantum algorithms for algebraic problems
• Simulating quantum systems using real Hilbert spaces
• Hamiltonian Quantum Cellular Automata in 1D
• Real Randomized Benchmarking
• Universal quantum computation on the power of quantum non-demolition measurements
• Qudit quantum computation on matrix product states with global symmetry
• Lineal: A linear-algebraic Lambda-calculus
• Lectures on Quantum Tensor Networks
• Number-Theoretic Characterizations of Some Restricted Clifford+T Circuits
• Pseudorandom unitaries are neither real nor sparse nor noise-robust
• Experimental entanglement characterization of two-rebit states
• Quantum Information Processing with Adversarial Devices
• Linear-algebraic lambda-calculus
• Quantum simulation from the bottom up: the case of rebits
• Characterization of universal two-qubit Hamiltonians
• The computational power of matchgates and the XY interaction on arbitrary graphs
• The Extension of Unital Completely Positive Semigroups on Operator Systems to Semigroups on $C^{\ast }$-algebras
• A quantum homomorphic encryption scheme for polynomial-sized circuits
• Spread and asymmetry of typical quantum coherence and their inhibition in response to glassy disorder
• Quantum mechanics is *-algebras and tensor networks
• Monte Carlo Quantum Computing
• The Computational Power of Non-interacting Particles