• Corpus ID: 16121906

Estimating Diagonal Entries of Powers of Sparse Symmetric Matrices is BQP-complete

@article{Janzing2006EstimatingDE,
  title={Estimating Diagonal Entries of Powers of Sparse Symmetric Matrices is BQP-complete},
  author={Dominik Janzing and Pawel Wocjan},
  journal={arXiv: Quantum Physics},
  year={2006}
}
Let A be a real symmetric matrix of size N such that the number of the non-zero entries in each row is polylogarithmic in N and the positions and the values of these entries are specified by an efficiently computable function. We consider the problem of estimating an arbitrary diagonal entry (A m )jj of the matrix A m up to an error of ǫ b m , where b is an a priori given upper bound on the norm of A, m and ǫ are polylogarithmic and inverse polylogarithmic in N, respectively. We show that this… 

Figures from this paper

The BQP-hardness of approximating the Jones polynomial
TLDR
The universality proof of Freedman et al (2002) is extended to ks that grow polynomially with the number of strands and crossings in the link, thus extending the BQP-hardness of Jones polynomial approximations to all values to which the AJL algorithm applies, proving that for all those values, the problems are B QP-complete.
Fast quantum algorithms for approximating some irreducible representations of groups
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms
Resource optimization for fault-tolerant quantum computing
TLDR
This thesis shows how to simplify universal encoded computation by using only transversal gates and standard error correction procedures, circumventing existing no-go theorems and finds that by using a special class of non-deterministic circuits, the cost of decomposition can be reduced by as much as a factor of four over state-of-the-art techniques, which typically use deterministic circuits.
Quantum Technology for Economists
TLDR
This manuscript provides an accessible introduction to this emerging field for economists that is centered around quantum computing and quantum money, an early invention of the quantum communication literature that has recently been partially implemented in an experimental setting.
Quantum computation beyond the circuit model
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of
Institute for Quantum Information Quantum Algorithms and Quantum Complexity
TLDR
The primary goal of the Institute for Quantum Information is to carry out and facilitate research in quantum information science, which covers five broad areas: quantum algorithms that achieve speedups relative to classical algorithms, and limits on such algorithms.

References

SHOWING 1-10 OF 22 REFERENCES
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
We present an efficient quantum algorithm for simulating the evolution of a quantum state for a sparse Hamiltonian H over a given time t in terms of a procedure for computing the matrix entries of H.
Several natural BQP-Complete problems
TLDR
Several BQP-complete problems are presented, including Local Hamiltonian Eigenvalue Sampling and Phase Estimation Sampling, which are closely related to the well-known quantum algorithm and quantum complexity theories.
The BQP-hardness of approximating the Jones polynomial
TLDR
The universality proof of Freedman et al (2002) is extended to ks that grow polynomially with the number of strands and crossings in the link, thus extending the BQP-hardness of Jones polynomial approximations to all values to which the AJL algorithm applies, proving that for all those values, the problems are B QP-complete.
"NON-IDENTITY-CHECK" IS QMA-COMPLETE
TLDR
A computational problem that is complete for the complexity class QMA, a quantum generalization of NP, is described, where non-equivalence check is also in QMA and hence QMA-complete.
The Complexity of the Local Hamiltonian Problem
TLDR
This paper settles the question and shows that the 2-LOCAL HAMILTONIAN problem is QMA-complete, and demonstrates that adiabatic computation with two-local interactions on qubits is equivalent to standard quantum computation.
The Jones polynomial: quantum algorithms and applications in quantum complexity theory
TLDR
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.
Quantum computing and quadratically signed weight enumerators
Quantum Computation and Quadratically Signed Weight Enumerators
TLDR
It is proved that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators, which can be used to define and study complexity classes and their relationships to quantum computation.
Measuring 4-local qubit observables could probabilistically solve PSPACE
TLDR
It is conjecture that the class of physically existing interactions is large enough to allow the conclusion that precise energy measurements for general many-particle systems require control algorithms with high complexity.
Ergodic Quantum Computing
TLDR
A model for quantum computation where the result can be read out from the time average of the Hamiltonian dynamics of a 2-dimensional crystal on a cylinder, which reduces quantum computing to preparing basis states for some qubits, waiting, and measuring in the computational basis.
...
...