Search results
XEB test. As expected, this required N F 2 XEB 10 6 runs and was done in ~200s, a time that has so far resisted attempts to be overtaken by classical algorithms17–19.
Another attempt to pass the XEB test on the Sycamore quantum supremacy circuits is the recently proposed big-head approach [16], which can obtain a large number of correlated samples. Using 60 GPUs for 5 days, the authors of [16] gen-erated 1 610 correlated samples with XEB 0:739, passed the XEB test. We also noticed that very recent works [17,18]
- Feng Pan, Keyang Chen, Pan Zhang
- 2021
Oct 26, 2019 · Recently, Google announced the first demonstration of quantum computational supremacy with a programmable superconducting processor. Their demonstration is based on collecting samples from the output distribution of a noisy random quantum circuit, then applying a statistical test to those samples called Linear Cross-Entropy Benchmarking (Linear XEB). This raises a theoretical question: how ...
- Scott Aaronson, Sam Gunn
- arXiv:1910.12085 [quant-ph]
- 2019
Oct 7, 2019 · $\begingroup$ I picture a random quantum circuit as a random walk down the Hilbert space, starting from $|000\cdots\rangle$. After running some qubits through a random quantum circuit with a large enough depth, (a) the majority of strings have $~0$ amplitude and would never be expected to be sampled; (b) a small number of strings have a high probability of being sampled (but it's a small ...
spoo ng of the Linear XEB test in the aforementioned Google’s experiment for the \supremacy circuit" (53 qubits, 20 cycles), with a single batch of amplitudes. Here spoo ng means that, instead of running the actual simulation with a classical computer (i.e., output bit-strings according to the distribution of the actual quan-
May 5, 2020 · To our knowledge, this is the first such result for two dimensional circuits of super-constant depth. Our results can be considered as an evidence that fooling the linear XEB test might be easier than achieving a full simulation of the quantum circuit.
People also ask
Is XEB a QEC metric?
What is fxeb test?
Can XEB be performed on 1000 qubits?
How does XEB correlated with a high probability bitstring?
How long does a fxeb test take?
How much deviation does Google's XEB (based on Sim-PLI Ed Circuits) have?
applying a statistical test to those samples called Linear Cross-Entropy Benchmarking (Linear XEB). This raises a theoretical question: How hard is it for a classical computer to spoof the results of the Linear XEB test? In this short note, we adapt an analysis of Aaronson and Chen to prove a conditional hardness result for Linear XEB spoofing.
