Questions tagged [quantum-advantage]

"Quantum advantage" or "quantum supremacy" is the potential ability of quantum computing devices to solve problems that classical computers practically cannot.

13 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
8
votes
1answer
332 views

Number of qubits to achieve quantum supremacy?

Google's Sycamore paper describes achieving quantum supremacy on a $53$-qubit quantum computer. The layout of Sycamore is $n=6\times 9=54$ nearest neighbors, with one qubit nonfunctional. They apply ...
8
votes
0answers
63 views

Strong vs weak simulations and the polynomial hierarchy collapse

(Edited to make the argument and the question more precise) An argument for quantum computational "supremacy" (specifically in Bremner et al. and the Google paper) assumes that there exists a ...
5
votes
0answers
40 views

Is there a practical architecture-independent benchmark suitable for adversarial proof of quantum supremacy?

Recent quantum supremacy claims rely, among other things, on extrapolation, which motivates the question in the title, where the word "adversarial" is added to exclude such extrapolation-...
4
votes
1answer
119 views

Simulating quantum computers using anyon braiding

I am new to the concept of topological quantum computation (TQC). Recently I have been thinking about simulating a quantum computer on a classical computer. I know that if I use merely the unitary ...
3
votes
0answers
29 views

If a hybrid classical+quantum algorithm can achieve quantum advantage, does this mean that the quantum part alone can?

Take for example a variational algorithm which has a classical optimization part and a quantum sampling part. In principle, the quantum part can be simulated by another classical computer given ...
3
votes
0answers
43 views

Feynman method and polynomial time algorithm for XQUATH

Consider the Feynman algorithm for simulating quantum circuits, as given here. Consider the XQUATH conjecture for random quantum circuits from here, given by (XQUATH, or Linear Cross-Entropy Quantum ...
3
votes
0answers
61 views

Boson Sampling with a single beamsplitter

In Boson Sampling as first proposed by Aaronson and Arkhipov in arxiv.org/abs/1011.3245, the interferometer is made up of phase shifters and beamsplitters. As these gates are universal, drawing the ...
2
votes
0answers
61 views

Spreading of entanglement with depth for Haar random states

Consider a Haar random quantum state of depth $d$. Consider any bipartition of this state. According to this paper (page $2$): Haar-random states on $n$ qudits are nearly maximally entangled across ...
2
votes
0answers
47 views

Relation between approximate counting and sampling

Consider the following statement of Stockmeyer counting theorem. Given as input a function $f:\{0, 1\}^{n} \rightarrow \{0, 1\}^{m}$ and $y \in \{0, 1\}^{m}$, there is a procedure that runs in ...
2
votes
0answers
84 views

When is a Quantum Computer Slower Than a Classical Computer?

Someone offhandedly mentioned to me that quantum computers are sometimes significantly (I guess they meant asymptotically) slower than classical computers. Unfortunately, I didn't get any arguments ...
2
votes
0answers
45 views

Can quantum computers speed up parsing?

Can quantum computers offer Grover-like speed ups in parsing of context-free languages? For instance, general CFLs can be parsed in $O(n^3)$ with standard algorithm like https://en.wikipedia.org/wiki/...
2
votes
0answers
32 views

When we do a linear fit, what is the correlation coefficient of the estimated parameters?

In Google's quantum supremacy experiment, supplementary Section VIIIH, they calculate the correlation coefficient of the linear fit coefficients $p_0$,$p_1$. I can't figure out the definition of this ...
1
vote
0answers
38 views

Has any analogue quantum simulator showed quantum advantage yet?

Quantum advantage/supremacy was achieved by Google using a quantum computer and more recently by Pan Jianwei's group using photons. So I was wondering, has any analog quantum simulator showed quantum ...