Space-Bounded Unitary Quantum Computation with Postselection

  title={Space-Bounded Unitary Quantum Computation with Postselection},
  author={Seiichiro Tani},
  • S. Tani
  • Published in MFCS 30 June 2022
  • Mathematics
Space-bounded computation has been a central topic in classical and quantum complexity theory. In the quantum case, every elementary gate must be unitary. This restriction makes it unclear whether the power of space-bounded computation changes by allowing intermediate measurement. In the bounded error case, Fefferman and Remscrim [STOC 2021, pp.1343–1356] and Girish, Raz and Zhan [ICALP 2021, pp.73:1–73:20] recently provided the break-through results that the power does not change. This paper… 



Eliminating intermediate measurements in space-bounded Quantum computation

This work exhibits a procedure to eliminate all intermediate measurements that is simultaneously space efficient and time efficient, and shows that the definition of a space-bounded quantum complexity class is robust to allowing or forbidding intermediate measurements.

Quantum Logarithmic Space and Post-selection

This result gives a space-bounded version of the well-known result PostBQP = PP proved by Aaronson for polynomial-time quantum computation, and shows that PL coincides with the class of problems that can be solved by bounded-error logarithmic-space quantum algorithms that have no time bound.

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.

Quantum Logspace Algorithm for Powering Matrices with Bounded Norm

This result proves a quantum analogue of the result of Lange, McKenzie and Tapp that deterministic logspace is equal to reversible logspace [LMT00], and uses the results to show non-trivial classical simulations of quantum logspace learning algorithms.

Time-Space Efficient Simulations of Quantum Computations

The first nontrivial lower bound for general quantum algorithms solving problems related to satisfiability is obtained and applies to MAJSAT and MAJMAJSAT, which are the problems of determining the truth.

Quantum simulations of classical random walks and undirected graph connectivity

  • J. Watrous
  • Computer Science
    Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)
  • 1999
This paper shows that space-bounded quantum Turing machines can efficiently simulate a limited class of random processes-random walks on undirected graphs-without relying on measurements during the computation, and demonstrates that the Undirected graph connectivity problem for regular graphs can be solved by one-sided error quantum Turing Machines that run in logspace and require a single measurement at the end of their computations.

Quantum computing, postselection, and probabilistic polynomial-time

  • S. Aaronson
  • Computer Science
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2005
It is shown that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently, or probabilistic polynomial-time, and implies, as an easy corollary, a celebrated theorem of Beigel, Reingold and Spielman that PP is closed under intersection.

Power of Quantum Computation with Few Clean Qubits

It is proved that the TRACE ESTIMATION problem defined with fixed constant threshold parameters is complete for the classes of problems solvable by polynomial-time quantum computations with completeness 2/3 and soundness 1/3 using logarithmically many clean qubits and just one clean qubit.

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.