Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit

  title={Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit},
  author={Stephen P. Jordan and Gorjan Alagic},
The Turaev-Viro invariants are scalar topological invariants of three-dimensional manifolds. Here we show that the problem of estimating the Fibonacci version of the Turaev-Viro invariant of a mapping torus is a complete problem for the one clean qubit complexity class (DQC1). This complements a previous result showing that estimating the Turaev-Viro invariant for arbitrary manifolds presented as Heegaard splittings is a complete problem for the standard quantum computation model (BQP). We also… 
Quantum algorithms for invariants of triangulated manifolds
This article discusses the details of this construction in two specific cases, where the tetrahedral tensor is defined by the so-called Fibonacci anyon model and the resulting invariant is the well-known Turaev-Viro invariant of 3-manifolds.
Quantum Invariants of 3-manifolds and NP vs #P
This work uses basic tools from quantum computation to give a proof that the SO(3) Witten-Reshetikhin-Turaev (WRT) invariant of 3-manifolds is #P-hard to calculate, and applies this result to a question about the combinatorics of Heegaard splittings.
3-manifold diagrams and NP vs $\#$P
It is shown that, if NP $\neq \#$P, then there exist infinitely many 3-manifold diagrams which cannot be made logarithmically "thin" (relative to their overall size) except perhaps by an exponentially large number of local moves.
Hardness of classically sampling one clean qubit model with constant total variation distance error
It is shown that it is indeed possible to improve the multiplicative error hardness result to a constant total variation distance error one like other sub-universal quantum computing models such as the IQP model, the Boson Sampled model, and the Fourier Sampling model if the authors accept a modified version of the average case hardness conjecture.
Power of one nonclean qubit
The one-clean qubit model (or the DQC1 model) is a restricted model of quantum computing where only a single qubit of the initial state is pure and others are maximally mixed. Although the model is
Impossibility of Classically Simulating One-Clean-Qubit Computation
It is shown that the third-level collapse of the polynomial-time hierarchy can be strengthened to the second-level one and the classical simulatability of the one-clean-qubit model with further restrictions on the circuit depth or the gate types is studied.
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.
The computational power of normalizer circuits over black-box groups
This work presents a precise connection between Clifford circuits, Shor's factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for solving Abelian hidden subgroup problems, and finds that normalizer circuits are powerful enough to factorize and solve classically-hard problems in the black-box setting.
Normalizer Circuits and Quantum Computation
An efficient formalism for simulating families of quantum circuits, that are non-universal but comprise important quantum gates such as QFT or CNOT, is developed and used to design new algorithms that provide quantum speedups.
Fine-grained quantum computational supremacy
This paper studies "fine-grained" version of quantum supremacy that excludes some exponential-time classical simulations, and shows that output probability distributions of Clifford-$T quantum computing cannot be classically sampled within a constant multiplicative error.


Approximating Turaev-Viro 3-manifold invariants is universal for quantum computation
A quantum algorithm for additively approximating Turaev-Viro invariants of a manifold presented by a Heegaard splitting is given, establishing a novel relation between the task of distinguishing non-homeomorphic 3-manifolds and the power of a general quantum computer.
Estimating Jones and Homfly polynomials with one clean qubit
This work shows that one clean qubit computers can efficiently approximate the Jones and single-variable HOMFLY polynomials of the trace closure of a braid at any root of unity.
A Modular Functor Which is Universal¶for Quantum Computation
Abstract:We show that the topological modular functor from Witten–Chern–Simons theory is universal for quantum computation in the sense that a quantum circuit computation can be efficiently
Experimental approximation of the Jones polynomial with one quantum bit.
Experimental results show that for the restricted case of knots whose braid representations have four strands and exactly three crossings, identifying distinct knots is possible 91% of the time.
Estimating Jones polynomials is a complete problem for one clean qubit
It is shown that evaluating a certain approximation to the Jones polynomial at a fifth root of unity for the trace closure of a braid is a complete problem for the one clean qubit complexity class.
Efficient quantum processing of three–manifold topological invariants
A quantum algorithm for approximating efficiently three–manifold topological invariants in the framework of SU(2) Chern–Simons–Witten (CSW) topological quantum field theory at finite values of the
Experimental approximation of the Jones polynomial with DQC 1
We present experimental results approximating the Jones polynomial on DQC1 using 4 qubits in a liquid state nuclear magnetic resonance quantum information processor. Approximating the Jones
Quantum discord and the power of one qubit.
We use quantum discord to characterize the correlations present in the model called deterministic quantum computation with one quantum bit (DQC1), introduced by Knill and Laflamme [Phys. Rev. Lett.
Computation with Unitaries and One Pure Qubit
We define a semantic complexity class based on the model of quantum computing with just one pure qubit (as introduced by Knill and Laflamme) and discuss its computational power in terms of the
The Jones polynomial: quantum algorithms and applications in quantum complexity theory
It is concluded with direct proofs that evaluating the Jones polynomial of the plat closure at most primitive roots of unity is a #P-hard problem, while learning its most significant bit is PP-hard, circumventing the usual route through the TuttePolynomial and graph coloring.