Quantum Computers, Factoring, and Decoherence

In a quantum computer any superposition of inputs evolves unitarily into the corresponding superposition of outputs. It has been recently demonstrated that such computers can dramatically speed up the task of finding factors of large numbers -- a problem of great practical significance because of its cryptographic applications. Instead of the nearly exponential ($\sim \exp L^{1/3}$, for a number with $L$ digits) time required by the fastest classical algorithm, the quantum algorithm gives factors in a time polynomial in $L$ ($\sim L^2$). This enormous speed-up is possible in principle because quantum computation can simultaneously follow all of the paths corresponding to the distinct classical inputs, obtaining the solution as a result of coherent quantum interference between the alternatives. Hence, a quantum computer is sophisticated interference device, and it is essential for its quantum state to remain coherent in the course of the operation. In this report we investigate the effect of decoherence on the quantum factorization algorithm and establish an upper bound on a ``quantum factorizable'' $L$ based on the decoherence suffered per operational step.Comment: 7 pages,LaTex + 2 postcript figures in a uuencoded fil

Deutsch-Jozsa algorithm as a test of quantum computation

A redundancy in the existing Deutsch-Jozsa quantum algorithm is removed and a refined algorithm, which reduces the size of the register and simplifies the function evaluation, is proposed. The refined version allows a simpler analysis of the use of entanglement between the qubits in the algorithm and provides criteria for deciding when the Deutsch-Jozsa algorithm constitutes a meaningful test of quantum computation.Comment: 10 pages, 2 figures, RevTex, Approved for publication in Phys Rev

Approximate quantum error correction can lead to better codes

We present relaxed criteria for quantum error correction which are useful when the specific dominant noise process is known. These criteria have no classical analogue. As an example, we provide a four-bit code which corrects for a single amplitude damping error. This code violates the usual Hamming bound calculated for a Pauli description of the error process, and does not fit into the GF(4) classification.Comment: 7 pages, 2 figures, submitted to Phys. Rev.

Property testing of unitary operators

In this paper, we systematically study property testing of unitary operators. We first introduce a distance measure that reflects the average difference between unitary operators. Then we show that, with respect to this distance measure, the orthogonal group, quantum juntas (i.e. unitary operators that only nontrivially act on a few qubits of the system) and Clifford group can be all efficiently tested. In fact, their testing algorithms have query complexities independent of the system's size and have only one-sided error. Then we give an algorithm that tests any finite subset of the unitary group, and demonstrate an application of this algorithm to the permutation group. This algorithm also has one-sided error and polynomial query complexity, but it is unknown whether it can be efficiently implemented in general

Dynamics of quantum phase transition: exact solution in quantum Ising model

Quantum Ising model is an exactly solvable model of quantum phase transition. This paper gives an exact solution when the system is driven through the critical point at finite rate. The evolution goes through a series of Landau-Zener level anticrossings when pairs of quasiparticles with opposite pseudomomenta get excited with probability depending on the transition rate. Average density of defects excited in this way scales like a square root of the transition rate. This scaling is the same as the scaling obtained when the standard Kibble-Zurek mechanism of thermodynamic second order phase transitions is applied to the quantum phase transition in the Ising model.Comment: misprints corrected; version to appear in Phys.Rev.Let

Optimal estimation of quantum observables

We consider the problem of estimating the ensemble average of an observable on an ensemble of equally prepared identical quantum systems. We show that, among all kinds of measurements performed jointly on the copies, the optimal unbiased estimation is achieved by the usual procedure that consists in performing independent measurements of the observable on each system and averaging the measurement outcomes.Comment: Submitted to J. Math Phy

An intrinsic limit to quantum coherence due to spontaneous symmetry breaking

We investigate the influence of spontaneous symmetry breaking on the decoherence of a many-particle quantum system. This decoherence process is analyzed in an exactly solvable model system that is known to be representative of symmetry broken macroscopic systems in equilibrium. It is shown that spontaneous symmetry breaking imposes a fundamental limit to the time that a system can stay quantum coherent. This universal timescale is $t_{spon} \simeq 2\pi N \hbar / (k_B T)$, given in terms of the number of microscopic degrees of freedom $N$, temperature $T$, and the constants of Planck ($\hbar$) and Boltzmann ($k_B$).Comment: 4 pages, 3 figure

Extremal covariant measurements

We characterize the extremal points of the convex set of quantum measurements that are covariant under a finite-dimensional projective representation of a compact group, with action of the group on the measurement probability space which is generally non-transitive. In this case the POVM density is made of multiple orbits of positive operators, and, in the case of extremal measurements, we provide a bound for the number of orbits and for the rank of POVM elements. Two relevant applications are considered, concerning state discrimination with mutually unbiased bases and the maximization of the mutual information.Comment: 11 pages, no figure