# Questions tagged [complexity-theory]

For questions regarding complexity analysis of quantum algorithms and comparisons with complexities of classical algorithms.

150 questions
Filter by
Sorted by
Tagged with
1answer
66 views
+50

### Quantum hardness of XQUATH conjecture

Consider the XQUATH conjectures, as defined here (https://arxiv.org/abs/1910.12085, Definition 1). (XQUATH, or Linear Cross-Entropy Quantum Threshold Assumption). There is no polynomial-time ...
3answers
1k views

### Are spin-glass problems NP (-complete)?

It is well known that finding ground states for spin-glass systems (Ising, XY...) is NP-hard (at least as hard as the hardest NP-problems) so that they can be efficiently used to solve other NP ...
1answer
87 views

### Complexity of Quantum Satisfiability vs Local Hamiltonians

$k$QSAT$c$ is the promise problem where the input, given in an explicit encoding with finite number of bits, is a set $\{p_{1},p_{2},\ldots p_{m}\}$ of $k$-local projectors over a $n$-qbits register, ...
1answer
59 views

### The complexity of LH restricted to projectors

Let's denote $kLP_{c}$ the promise problem where the input, given in an explicit encoding with finite number of bits, is a set $\{p_{1},p_{2},\ldots p_{m}\}$ of k-local projectors over a n-qbits ...
1answer
121 views

### How is a promise gap related to a spectral gap?

In linear algebra one often concerns oneself with the spectral gap of a given matrix, which may be defined as the difference between the smallest and second-smallest eigenvalue (or, depending on ...
2answers
137 views

### The complexity of LH with constant gap

Kitaev's quantum equivalent of the Cook-Levin Theorem, provides a polynomial time classical reduction from a QMA verification circuit to a sum $H$ of local hamiltonians, such that the least eigenvalue ...
1answer
90 views

### How would I theorise a quantum query algorithm in O(1)?

I am currently attempting to solve a problem from Nielsen-Chuang, and I can't seem to figure out how I would do this; I'm trying to implement Grover's algorithm to solve the problem of differentiating ...
1answer
138 views

### Can quantum computer solve NP-complete problems? [duplicate]

As far as I know, quantum computers are able to solve only some of the NP-Problems in polynomial time, using the Grovers algorithm. I read that if one manages to create a reduction of Grovers ...
1answer
241 views

### Classical algorithm with complexity similar to Shor's discovered: Are there more efficient quantum algorithms than Shor's?

In the article Fast Factoring Integers by SVP Algorithms the author claims that he discovered classical algorithm for factoring integers in polynomial time. The Quantum Report mentioned here that it ...
1answer
50 views

### What does “large-scale universal quantum computation” mean?

I was reading this lecture notes by Sevag Gharibian. He mentioned the following statement: Large-scale universal quantum computer can be built. I do understand what quantum computer is, but I don't ...
0answers
53 views

### How do I calculate the number of uses of a unitary $U$ in iterative phase estimation?

How would one go along to calculate the number of uses of an unitary $U$ in Iterative Phase Estimation (IPE) to compare it to the number of uses of $U$ in standard Phase Estimation (Qiskit QPE)?
2answers
107 views

### Why does QAOA achieve quantum supremacy in an algorithmic sense?

In the paper Quantum Supremacy through the Quantum Approximate Optimization Algorithm the authors claim (last sentence of page 15): "If [...] the QAOA outperforms all known classical algorithms ...
1answer
33 views

### List of problems in the query complexity model with no super-polynomial quantum speedup

Similar to this list over at cstheory, I'm looking for a list of computational problems in the query complexity model for which it is known that no super-polynomial quantum speedups exist. What are ...
0answers
51 views

### Properties of QAOA

The QAOA algorithm consists of two elements: The outer loop, basically a classical optimization algorithm The quantum circuit, taking $2p$ parameters (where $p$ is the number of layers, where each ...
2answers
68 views

### What is the computational complexity of quantum annealing?

Quantum annealing can be thought of as a black box solver that can find approximate solutions to hard optimization problems. For example, D-Wave quantum annealers can approximately solve quadratic ...
2answers
155 views

### CS conjecture that Quantum Computer cannot solve NP-complete problems, but Boson Samplers do a #P-hard problem. How is it?

There is something very strange and absurd for me about the power of a quantum computer. Let me briefly states the following facts: Fact 1: theoretical computer scientists believe (very likely to ...
0answers
30 views

### What is the computational complexity of approximate quantum adders, in terms of big O notation?

I have recently found papers on approximate quantum adders. However, the papers do not seem to mention the computational complexities of their algorithms. What are their complexities, in terms of big ...
1answer
98 views

1answer
27 views

### How precise are BQP measurements?

Let's say I am given a Hamiltonian $H$, whose ground state is efficiently preparable. We know that $||H|| \leq 1$. Let that ground state be $|\psi_{0}\rangle$, with energy $E_{0}$. We also know that ...
1answer
100 views

0answers
35 views

### Is either the adiabatic or the diabatic version of quantum annealing known to be theoretically more powerful than the other?

Quantum annealing can be considered either in the perfectly adiabatic "slow" limit (in which case it's usually referred as "adiabatic quantum computing" (AQC) instead of "...
1answer
36 views