• Corpus ID: 16828892

Computational Complexity of Some Quantum Theories in $1+1$ Dimensions

  title={Computational Complexity of Some Quantum Theories in \$1+1\$ Dimensions},
  author={Saeed Adel Mehraban},
We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model, distinguishable particles start out with known momenta and initial superposition of different configurations. Then the label of these particles are measured at the end. We prove that additive approximation to single amplitudes of these models can be obtained by the one-clean-qubit model, if no initial superpositions… 

Computational complexity of nonequilibrium steady states of quantum spin chains

We study non-equilibrium steady states (NESS) of spin chains with boundary Markovian dissipation from the computational complexity point of view. We focus on XX chains whose NESS are matrix product

Quantum Supremacy through the Quantum Approximate Optimization Algorithm

It is argued that beyond its possible computational value the QAOA can exhibit a form of Quantum Supremacy in that, based on reasonable complexity theoretic assumptions, the output distribution of even the lowest depth version cannot be efficiently simulated on any classical device.

Further extensions of Clifford circuits and their classical simulation complexities

  • D. E. Koh
  • Computer Science
    Quantum Inf. Comput.
  • 2017
The results provide more examples where seemingly modest changes to the ingredients of Clifford circuits lead to "large" changes in the classical simulation complexities of the circuits, and also include new examples of extended Clifford circuits that exhibit "quantum supremacy", in the sense that it is not possible to efficiently classically sample from the output distributions of such circuits, unless the polynomial hierarchy collapses.



Quantum complexity theory

This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation.

Quantum computation

The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones

Classical simulation of noninteracting-fermion quantum circuits

It is shown 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 noninteracting fermions in one dimension.

Power of One Bit of Quantum Information

In standard quantum computation, the initial state is pure and the answer is determined by making a measurement of some of the bits in the computational basis. What can be accomplished if the initial

On the hardness of classically simulating the one clean qubit model

This Letter introduces a slightly modified version of DQC1, which it is shown that DZC1(k) cannot be classically efficiently simulated for any k≥3 unless the polynomial hierarchy collapses at the third level.

Encoded Universality in Physical Implementations of a Quantum Computer

A general Lie-algebraic framework is outlined which can be used to find the encoding for universality in quantum computing and several examples relevant to solid-state quantum computing are given.

The computational complexity of linear optics

A model of computation in which identical photons are generated, sent through a linear-optical network, then nonadaptively measured to count the number of photons in each mode is defined, giving new evidence that quantum computers cannot be efficiently simulated by classical computers.

Quantum computation by measurements

We first consider various methods for the indirect implementation of unitary gates. We apply these methods to rederive the universality of 4-qubit measurements based on a scheme much simpler than

Encoding a qubit in an oscillator

Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes

Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy

  • M. BremnerR. JozsaD. Shepherd
  • Computer Science, Mathematics
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2010
The class post-IQP of languages decided with bounded error by uniform families of IQP circuits with post-selection is introduced, and it is proved first that post- IQP equals the classical class PP, and that if the output distributions of uniform IQP circuit families could be classically efficiently sampled, then the infinite tower of classical complexity classes known as the polynomial hierarchy would collapse to its third level.