Quantum Algorithms for Fermionic Quantum Field Theories

Extending previous work on scalar field theories, we develop a quantum algorithm to compute relativistic scattering amplitudes in fermionic field theories, exemplified by the massive Gross-Neveu model, a theory in two spacetime dimensions with quartic interactions. The algorithm introduces new techniques to meet the additional challenges posed by the characteristics of fermionic fields, and its run time is polynomial in the desired precision and the energy. Thus, it constitutes further progress towards an efficient quantum algorithm for simulating the Standard Model of particle physics.Comment: 29 page

Quantum Computation of Scattering in Scalar Quantum Field Theories

Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally, and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great computational complexity and can generally be performed only when the interaction strength is weak. A full understanding of the foundations and rich consequences of quantum field theory remains an outstanding challenge. We develop a quantum algorithm to compute relativistic scattering amplitudes in massive phi-fourth theory in spacetime of four and fewer dimensions. The algorithm runs in a time that is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. Thus, it offers exponential speedup over existing classical methods at high precision or strong coupling

Quantum Algorithms for Quantum Field Theories

Quantum field theory reconciles quantum mechanics and special relativity, and plays a central role in many areas of physics. We develop a quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory with quartic self-interactions (phi-fourth theory) in spacetime of four and fewer dimensions. Its run time is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. In the strong-coupling and high-precision regimes, our quantum algorithm achieves exponential speedup over the fastest known classical algorithm.Comment: v2: appendix added (15 pages + 25-page appendix

Computational equivalence of the two inequivalent spinor representations of the braid group in the Ising topological quantum computer

We demonstrate that the two inequivalent spinor representations of the braid group \B_{2n+2}, describing the exchanges of 2n+2 non-Abelian Ising anyons in the Pfaffian topological quantum computer, are equivalent from computational point of view, i.e., the sets of topologically protected quantum gates that could be implemented in both cases by braiding exactly coincide. We give the explicit matrices generating almost all braidings in the spinor representations of the 2n+2 Ising anyons, as well as important recurrence relations. Our detailed analysis allows us to understand better the physical difference between the two inequivalent representations and to propose a process that could determine the type of representation for any concrete physical realization of the Pfaffian quantum computer.Comment: 9 pages, 2 figures, published versio

BQP-completeness of Scattering in Scalar Quantum Field Theory

Recent work has shown that quantum computers can compute scattering probabilities in massive quantum field theories, with a run time that is polynomial in the number of particles, their energy, and the desired precision. Here we study a closely related quantum field-theoretical problem: estimating the vacuum-to-vacuum transition amplitude, in the presence of spacetime-dependent classical sources, for a massive scalar field theory in (1+1) dimensions. We show that this problem is BQP-hard; in other words, its solution enables one to solve any problem that is solvable in polynomial time by a quantum computer. Hence, the vacuum-to-vacuum amplitude cannot be accurately estimated by any efficient classical algorithm, even if the field theory is very weakly coupled, unless BQP=BPP. Furthermore, the corresponding decision problem can be solved by a quantum computer in a time scaling polynomially with the number of bits needed to specify the classical source fields, and this problem is therefore BQP-complete. Our construction can be regarded as an idealized architecture for a universal quantum computer in a laboratory system described by massive phi^4 theory coupled to classical spacetime-dependent sources.Comment: 41 pages, 7 figures. Corrected typo in foote

Measured Quantum Fourier Transform of 1024 Qubits on Fiber Optics

Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation gate. Error probability was estimated to be 0.01 per qubit, which corresponded to error-free operation on 100 qubits. The error probability can be further reduced by taking the majority of the accumulated results. The reduction of error probability resulted in a successful QFT demonstration on 1024 qubits.Comment: 15 pages, 6 figures, submitted to EQIS 2003 Special issue, Int. J. Quantum Informatio

Discrimination of two mixed quantum states with maximum confidence and minimum probability of inconclusive results

We study an optimized measurement that discriminates two mixed quantum states with maximum confidence for each conclusive result, thereby keeping the overall probability of inconclusive results as small as possible. When the rank of the detection operators associated with the two different conclusive outcomes does not exceed unity we obtain a general solution. As an application, we consider the discrimination of two mixed qubit states. Moreover, for the case of higher-rank detection operators we give a solution for particular states. The relation of the optimized measurement to other discrimination schemes is also discussed.Comment: 7 pages, 1 figure, accepted for publication in Phys. Rev.

Entangling characterization of (SWAP)1/m and Controlled unitary gates

We study the entangling power and perfect entangler nature of (SWAP)1/m, for m>=1, and controlled unitary (CU) gates. It is shown that (SWAP)1/2 is the only perfect entangler in the family. On the other hand, a subset of CU which is locally equivalent to CNOT is identified. It is shown that the subset, which is a perfect entangler, must necessarily possess the maximum entangling power.Comment: 12 pages, 1 figure, One more paragraph added in Introductio

Quantum information processing with noisy cluster states

We provide an analysis of basic quantum information processing protocols under the effect of intrinsic non-idealities in cluster states. These non-idealities are based on the introduction of randomness in the entangling steps that create the cluster state and are motivated by the unavoidable imperfections faced in creating entanglement using condensed-matter systems. Aided by the use of an alternative and very efficient method to construct cluster state configurations, which relies on the concatenation of fundamental cluster structures, we address quantum state transfer and various fundamental gate simulations through noisy cluster states. We find that a winning strategy to limit the effects of noise, is the management of small clusters processed via just a few measurements. Our study also reinforces recent ideas related to the optical implementation of a one-way quantum computer.Comment: 13 pages, 13 figures, RevTe