The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Temporally unstructured quantum computation
Abstract
We examine theoretic architectures and an abstract model for a restricted class of quantum computation, called here temporally unstructured (‘ 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 efficiently and accurately. This paradigm also admits simple interactive proof games that may convince a sceptic 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“the [[8,3,2]] gate set presented here can realize arbitrary IQP circuits composed of {CCZ, CZ, Z} gates105.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [105]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
Vandersypen, L. M. K., Steffen, M., Breyta, G., Yannoni, C. S., Sherwood, M. H., & Chuang, I. L. (2001) · Nature · doi:10.1038/414883a · Cited by 1,738
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655
Experimental Demonstration of a Compiled Version of Shor’s Algorithm with Quantum Entanglement
Lanyon, B. P., Weinhold, T. J., Langford, N. K., Barbieri, M., James, D. F. V., Gilchrist, A., & White, A. G. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.250505 · Cited by 327
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
Valiant, L. G. (2002) · SIAM Journal on Computing · doi:10.1137/s0097539700377025 · Cited by 311
On entropy growth and the hardness of simulating time evolution
Schuch, N., Wolf, M. M., Vollbrecht, K. G. H., & Cirac, J. I. (2008) · New Journal of Physics · doi:10.1088/1367-2630/10/3/033032 · Cited by 113
Flagged first, then by citations
Research works printed but not linked: 16
- 10.1098/rspa.2005.1546 · DOI
- Browne D. E. & Briegel H. J. 2006 Oneway quantum computation. In Lectures on quantum information pp. 359–380. (http://arXiv.org/abs/quant-ph/0603226). · DOI
- Cleve R. & Watrous J. 2000 Fast parallel circuits for the quantum Fourier transform. In Proc. 41st Ann. Symp. on Foundations of Computer Science pp. 526–536. · DOI
- 10.4086/toc.2005.v001a005 · DOI
- 10.1098/rspa.2008.0189 · DOI
- 10.1103/PhysRevLett.99.250504 · DOI
- MacWilliams F.J.& Sloane J.A. The theory of error-correcting codes. 1996 Amsterdam The Netherlands:Elsevier Science.
- 10.1137/050644756 · DOI · Paper page
- Oxley J.G. Matroid theory. 1992 New York NY:Oxford University Press.
- Papadimitriou C.H. Computational complexity. 1994 Reading MA:Addison-Wesley.
- 10.1103/PhysRevLett.86.5188 · DOI · Paper page
- 10.1103/PhysRevLett.100.030504 · DOI
- 10.1137/S0097539796298637 · DOI · Paper page
- 10.1103/PhysRevLett.98.140501 · DOI · Paper page
- Terhal B.M., 2004, Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games, Quant. Inf. Comp, 4, 134
- Vyalyi M. N. 2003 Hardness of approximating the weight enumerator of a binary linear code. Preprint. (http://arXiv.org/abs/cs/0304044v1). · arXiv
Cited by
Sorted by citations
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119
The computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
Expressive power of parametrized quantum circuits
Du, Y., Hsieh, M.-H., Liu, T., & Tao, D. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033125 · Cited by 318
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Bremner, M. J., Jozsa, R., & Shepherd, D. J. (2011) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2010.0301 · Cited by 308
Self-citation
Metadata
- Authors
- Shepherd, D., & Bremner, M. J.
- Affiliations
- Department of Computer Science, University of BristolWoodland Road, Bristol BS8 1UB, UK
- Venue
- Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Publisher
- The Royal Society
- Published
- 2009-02-20
- Volume
- 465
- Issue
- 2105
- Pages
- 1413-1439
- ISSN
- 1364-5021
- 1471-2946
- Cited by
- 135
- References
- 6
- Language
- en
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
