output
19922026
most citedQuantum Computation with Quantum Dots

6.9k citations

Showing 2001 · quant-phShow all

6 papers · 2 filters

quant-ph2001★ 1 cited

Simulation and reversal of n-qubit Hamiltonians using Hadamard matrices

D. W. Leung

The ability to simulate one Hamiltonian with another is an important primitive in quantum information processing. In this paper, a simulation method for arbitrary …

quant-ph2001★ 329 cited

Classical simulation of noninteracting-fermion quantum circuits

Barbara M. Terhal, David P. DiVincenzo

We show that a class of quantum computations that was recently shown to be efficiently simulatable on a classical computer by Valiant corresponds to a physical model of noninteract…

quant-ph2001★ 25 cited

Enhanced Autocompensating Quantum Cryptography System

Donald S. Bethune, Martha Navarro, William P. Risk

We have improved the hardware and software of our autocompensating system for quantum key distribution by replacing bulk optical components at the end stations with fiber-optic equ…

quant-ph2001★ 2 cited

More Is Not Necessarily Easier

Debbie W. Leung, John A. Smolin

In this brief comment, we consider the exact, deterministic, and nonasymptotic transformation of multiple copies of pure states under LOCC. It was conjectured in quant-ph/0103131 t…

quant-ph2001★ 18 cited

Encoded Universality in Physical Implementations of a Quantum Computer

D. Bacon, J. Kempe, D. P. DiVincenzo +2

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.,…

quant-ph2001★ 9 cited

Detecting Quantum Entanglement

Barbara M. Terhal

We review the criteria for separability and quantum entanglement, both in a bipartite as well as a multipartite setting. We discuss Bell inequalities, entanglement witnesses, entro…