Encoded Universality in Physical Implementations of a Quantum Computer

Abstract

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 qubits directly. Starting with the interactions intrinsic to the physical system, we show how to determine the possible universality resulting from these interactions over an encoded subspace. We outline a general Lie-algebraic framework which can be used to find the encoding for universality and give several examples relevant to solid-state quantum computing.

6 pages, no figures. To appear in proceedings of the International Conference on Experimental Implementation of Quantum Computation, Sydney, Australia (IQC 01), minor changes, references updated

Cited by in corpus (8)

• Classical simulation of noninteracting-fermion quantum circuits
• A Simple Proof that Toffoli and Hadamard are Quantum Universal
• The BQP-hardness of approximating the Jones Polynomial
• Decoherence, Control, and Symmetry in Quantum Computers
• Dynamically Generated Decoherence-Free Subspaces and Subsystems on Superconducting Qubits
• Quantum Computers and Decoherence: Exorcising the Demon from the Machine
• Universal quantum computation via quantum controlled classical operations
• Permutationally Invariant Codes for Quantum Error Correction