REVIEW 3 cited by
Instantaneous Quantum Computation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We examine theoretic architectures and an abstract model for a restricted class of quantum computation, called here instantaneous quantum computation because it allows for essentially no temporal structure within the quantum dynamics. Using the theory of binary matroids, we argue that the paradigm is rich enough to enable sampling from probability distributions that cannot, classically, be sampled from efficiently and accurately. This paradigm also admits simple interactive proof games that may convince a skeptic of the existence of truly quantum effects. Furthermore, these effects can be created using significantly fewer qubits than are required for running Shor's Algorithm.
Forward citations
Cited by 3 Pith papers
-
Weak Permanent Anti-Concentration for Random Gaussian Matrices in Boson Sampling
Random Gaussian permanents satisfy a weak anti-concentration bound: they rarely dip superexponentially below their standard deviation.
-
Quantum encodings that preserve persistent homology
Investigates which quantum encodings of classical datasets preserve persistent homology so that quantum algorithms can extract topological features directly from the data.
-
Polynomial Resource Classification of Quantum Circuit Familes via Classical Shadows
Z-only measurements classify small IQP, Clifford, and Clifford+T circuits with up to 0.91 accuracy and outperform classical shadows, but all four strategies drop to chance level above 12 qubits with quadratic shots.
Discussion (0). Continue with ORCID to comment.