activity
19942004
most citedSeparability Criterion for Density Matrices

5.2k citations · 8.8k across the 55 of their papers we have counts for

collaborators
Showing 1996Show all

8 papers · 1 filter

quant-ph1996★ 2 cited

Error correction and symmetrization in quantum computers

Asher Peres

Errors in quantum computers are of two kinds: sudden perturbations to isolated qubits, and slow random drifts of all the qubits. The latter may be reduced, but not eliminated, by m…

quant-ph1996★ 73 cited

Quantum codewords contradict local realism

David P. DiVincenzo, Asher Peres

Quantum codewords are highly entangled combinations of two-state systems. The standard assumptions of local realism lead to logical contradictions similar to those found by Bell, K…

quant-ph1996

Quantum nonlocality and inseparability

Asher Peres

A quantum system consisting of two subsystems is separable if its density matrix can be written as , where and are density matrices for…

quant-ph1996

Unitary dynamics for quantum codewords

Asher Peres

A quantum codeword is a redundant representation of a logical qubit by means of several physical qubits. It is constructed in such a way that if one of the physical qubits is pertu…

quant-ph1996★ 3 cited

Quaternionic quantum interferometry

Asher Peres

If scattering amplitudes are ordinary complex numbers (not quaternions) there is a universal algebraic relationship between the six coherent cross sections of any three scatterers…

quant-ph1996★ 3 cited

Error symmetrization in quantum computers

Asher Peres

It is possible to reduce some types of quantum computation errors by symmetrizing the quantum state of a redundant array. Various models are discussed.