All Questions
Tagged with google-sycamore random-quantum-circuit
9
questions
3
votes
1
answer
176
views
What is the role of choosing the single-qubits randomly in Google quantum supremacy experiment?
In supremacy paper and part D of section VII of supplementary information (below), it is said that there is a pseudo-random number generator that is initialized with a seed called $s$; And then the ...
- 313
7
votes
1
answer
354
views
What did exactly Google do in simulating a random quantum circuit on a classical computer in supremacy experiment?
I've been working on Google quantum supremacy paper for quite some time now and I have a problem in understanding how exactly they simulate their actual random quantum circuit on a classical computer.
...
- 313
4
votes
2
answers
251
views
How exactly is solving the random circuit sampling problem a computation in the Church-Turing thesis sense?
Note: This has been cross-posted to CS Theory SE.
If we assume $\mathsf{BQP} \neq \mathsf{BPP}$, then we can say with reasonable certainty that Google's random sampling experiment falsifies the ...
- 17.7k
7
votes
1
answer
295
views
Are 20 repetitions of Sycamore's one- and 2-qubit gates sufficient to produce a uniformly random state?
In the answer to this question about random circuits, James Wootton states:
One way to see how well we [fully explore the Hilbert space] is to focus on just randomly producing $n$ qubit states. ...
- 12.9k
10
votes
2
answers
570
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 ...
- 12.9k
6
votes
1
answer
837
views
Understanding Google's “Quantum supremacy using a programmable superconducting processor” (Part 3): sampling
In Google's 54 qubit Sycamore processor, they created a 53 qubit quantum circuit using a random selection of gates from the set $\{\sqrt{X}, \sqrt{Y}, \sqrt{W}\}$ in the following pattern:
...
- 17.7k
9
votes
1
answer
1k
views
Understanding Google's “Quantum supremacy using a programmable superconducting processor” (Part 2): simplifiable and intractable tilings
In Google's 54 qubit Sycamore processor, they created a 53 qubit quantum circuit using a random selection of gates from the set $\{\sqrt{X}, \sqrt{Y}, \sqrt{W}\}$ in the following pattern:
...
- 17.7k
12
votes
2
answers
1k
views
Understanding Google's “Quantum supremacy using a programmable superconducting processor” (Part 1): choice of gate set
I was recently going through the paper titled "Quantum supremacy using a programmable superconducting processor" by NASA Ames Research Centre and the Google Quantum AI team (note that the paper was ...
- 17.7k
4
votes
2
answers
385
views
Do quantum supremacy experiments repeatedly apply the same random unitary?
It is my understanding that, given a quantum computer with $n$ qubits and a way to apply $m$ single- and 2-qubit gates, quantum supremacy experiments
Initialize the $n$ qubits into the all-zero's ket ...
- 12.9k