Searcharxiv⌕ Search

arXiv subjects

Michael A. Nielsen

Publications and source records attributed to Michael A. Nielsen.

At least 37 records · Page 2Linked to original sources

Optical quantum computation using cluster states

We propose an approach to optical quantum computation in which a deterministic entangling quantum gate may be performed using, on average, a few hundred coherently interacting optical elements (beamsplitters, phase shifters, single photon sources, and photodetectors with feedforward). This scheme combines ideas from the optical quantum computing proposal of Knill, Laflamme and Milburn [Nature 409 (6816), 46 (2001)], and the abstract cluster-state model of quantum computation proposed by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)].

quant-ph↗

Frustration, interaction strength and ground-state entanglement in complex quantum systems

Entanglement in the ground state of a many-body quantum system may arise when the local terms in the system Hamiltonian fail to commute with the interaction terms in the Hamiltonian. We quantify this phenomenon, demonstrating an analogy between ground-state entanglement and the phenomenon of frustration in spin systems. In particular, we prove that the amount of ground-state entanglement is bounded above by a measure of the extent to which interactions frustrate the local terms in the Hamiltonian. As a corollary, we show that the amount of ground-state entanglement is bounded above by a ratio between parameters characterizing the strength of interactions in the system, and the local energy scale. Finally, we prove a qualitatively similar result for other energy eigenstates of the system.

quant-ph↗

Entanglement, correlations, and the energy gap in many-body quantum systems

What correlations are present in the ground state of a many-body Hamiltonian? We study the relationship between ground-state correlations, especially entanglement, and the energy gap between the ground and first excited states. We prove several general inequalities which show quantitatively that ground-state correlations between systems not directly coupled by the Hamiltonian necessarily imply a small energy gap.

quant-ph↗

Lower bounds on the complexity of simulating quantum gates

We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries. We also note that a related lower bound holds for arbitrary n-qubit gates.

quant-ph↗

Fungible dynamics: there are only two types of entangling multiple-qubit interactions

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? It has been shown that all two-body Hamiltonian evolutions can be simulated using \emph{any} fixed two-body entangling $n$-qubit Hamiltonian and fast local unitaries. By \emph{entangling} we mean that every qubit is coupled to every other qubit, if not directly, then indirectly via intermediate qubits. We extend this study to the case where interactions may involve more than two qubits at a time. We find necessary and sufficient conditions for an arbitrary $n$-qubit Hamiltonian to be \emph{dynamically universal}, that is, able to simulate any other Hamiltonian acting on $n$ qubits, possibly in an inefficient manner. We prove that an entangling Hamiltonian is dynamically universal if and only if it contains at least one coupling term involving an \emph{even} number of interacting qubits. For \emph{odd} entangling Hamiltonians, i.e., Hamiltonians with couplings that involve only an odd number of qubits, we prove that dynamic universality is possible on an encoded set of $n-1$ logical qubits. We further prove that an odd entangling Hamiltonian can simulate any other odd Hamiltonian and classify the algebras that such Hamiltonians generate. Thus, our results show that up to local unitary operations, there are only two fundamentally different types of entangling Hamiltonian on $n$ qubits. We also demonstrate that, provided the number of qubits directly coupled by the Hamiltonian is bounded above by a constant, our techniques can be made efficient.

quant-ph↗

On the practicality of time-optimal two-qubit Hamiltonian simulation

What is the time-optimal way of using a set of control Hamiltonians to obtain a desired interaction? Vidal, Hammerer and Cirac [Phys. Rev. Lett. 88 (2002) 237902] have obtained a set of powerful results characterizing the time-optimal simulation of a two-qubit quantum gate using a fixed interaction Hamiltonian and fast local control over the individual qubits. How practically useful are these results? We prove that there are two-qubit Hamiltonians such that time-optimal simulation requires infinitely many steps of evolution, each infinitesimally small, and thus is physically impractical. A procedure is given to determine which two-qubit Hamiltonians have this property, and we show that almost all Hamiltonians do. Finally, we determine some bounds on the penalty that must be paid in the simulation time if the number of steps is fixed at a finite number, and show that the cost in simulation time is not too great.

quant-ph↗

Quantum states far from the energy eigenstates of any local Hamiltonian

What quantum states are possible energy eigenstates of a many-body Hamiltonian? Suppose the Hamiltonian is non-trivial, i.e., not a multiple of the identity, and L-local, in the sense of containing interaction terms involving at most L bodies, for some fixed L. We construct quantum states ψwhich are ``far away'' from all the eigenstates E of any non-trivial L-local Hamiltonian, in the sense that |ψ-E| is greater than some constant lower bound, independent of the form of the Hamiltonian.

quant-ph↗

How robust is a quantum gate in the presence of noise?

We define several quantitative measures of the robustness of a quantum gate against noise. Exact analytic expressions for the robustness against depolarizing noise are obtained for all unitary quantum gates, and it is found that the controlled-not is the most robust two-qubit quantum gate, in the sense that it is the quantum gate which can tolerate the most depolarizing noise and still generate entanglement. Our results enable us to place several analytic upper bounds on the value of the threshold for quantum computation, with the best bound in the most pessimistic error model being 0.5.

quant-ph↗

Quantum dynamics as a physical resource

How useful is a quantum dynamical operation for quantum information processing? Motivated by this question we investigate several strength measures quantifying the resources intrinsic to a quantum operation. We develop a general theory of such strength measures, based on axiomatic considerations independent of state-based resources. The power of this theory is demonstrated with applications to quantum communication complexity, quantum computational complexity, and entanglement generation by unitary operations.

quant-ph↗

Quantum information science as an approach to complex quantum systems

What makes quantum information science a science? These notes explore the idea that quantum information science may offer a powerful approach to the study of complex quantum systems. We discuss how to quantify complexity in quantum systems, and argue that there are two qualitatively different types of complex quantum system. We also explore ways of understanding complex quantum dynamics by quantifying the strength of a quantum dynamical operation as a physical resource. This is the text for a talk at the ``Sixth International Conference on Quantum Communication, Measurement and Computing'', held at MIT, July 2002. Viewgraphs for the talk may be found at http://www.qinfo.org/talks/.

quant-ph↗

A practical scheme for quantum computation with any two-qubit entangling gate

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. Here we present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this important result for systems of arbitrary finite dimension has been provided by J. L. and R. Brylinski [arXiv:quant-ph/0108062, 2001]; however, their proof relies upon a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical [C. M. Dawson and A. Gilchrist, online implementation of the procedure described herein (2002), http://www.physics.uq.edu.au/gqc/].

quant-ph↗

Universal simulation of Hamiltonian dynamics for qudits

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling N-qubit Hamiltonian, and local unitaries. We extend this result to the case where the component systems have D dimensions. As a consequence we explain how universal quantum computation can be performed with any fixed two-body entangling N-qudit Hamiltonian, and local unitaries.

quant-ph↗

A simple formula for the average gate fidelity of a quantum dynamical operation

This note presents a simple formula for the average fidelity between a unitary quantum gate and a general quantum operation on a qudit, generalizing the formula for qubits found by Bowdrey et al [Phys. Lett. A 294, 258 (2002)]. This formula may be useful for experimental determination of average gate fidelity. We also give a simplified proof of a formula due to Horodecki et al [Phys. Rev. A 60, 1888 (1999)], connecting average gate fidelity to entanglement fidelity.

quant-ph↗

Entanglement, quantum phase transitions, and density matrix renormalization

We investigate the role of entanglement in quantum phase transitions, and show that the success of the density matrix renormalization group (DMRG) in understanding such phase transitions is due to the way it preserves entanglement under renormalization. We provide a reinterpretation of the DMRG in terms of the language and tools of quantum information science which allows us to rederive the DMRG in a physically transparent way. Motivated by our reinterpretation we suggest a modification of the DMRG which manifestly takes account of the entanglement in a quantum system. This modified renormalization scheme is shown,in certain special cases, to preserve more entanglement in a quantum system than traditional numerical renormalization methods.

quant-ph↗

Entanglement in a simple quantum phase transition

What entanglement is present in naturally occurring physical systems at thermal equilibrium? Most such systems are intractable and it is desirable to study simple but realistic systems which can be solved. An example of such a system is the 1D infinite-lattice anisotropic XY model. This model is exactly solvable using the Jordan-Wigner transform, and it is possible to calculate the two-site reduced density matrix for all pairs of sites. Using the two-site density matrix, the entanglement of formation between any two sites is calculated for all parameter values and temperatures. We also study the entanglement in the transverse Ising model, a special case of the XY model, which exhibits a quantum phase transition. It is found that the next-nearest neighbour entanglement (though not the nearest-neighbour entanglement) is a maximum at the critical point. Furthermore, we show that the critical point in the transverse Ising model corresponds to a transition in the behaviour of the entanglement between a single site and the remainder of the lattice.

quant-ph↗

An entanglement monotone derived from Grover's algorithm

This paper demonstrates that how well a state performs as an input to Grover's search algorithm depends critically upon the entanglement present in that state; the more entanglement, the less well the algorithm performs. More precisely, suppose we take a pure state input, and prior to running the algorithm apply local unitary operations to each qubit in order to maximize the probability P_max that the search algorithm succeeds. We prove that, for pure states, P_max is an entanglement monotone, in the sense that P_max can never be decreased by local operations and classical communication.

quant-ph↗