Temporally unstructured quantum computation

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.

[1]  R. Jozsa,et al.  Matchgates and classical simulation of quantum circuits , 2008, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[2]  Michael M. Wolf,et al.  On entropy growth and the hardness of simulating time evolution , 2008, 0801.2078.

[3]  Norbert Schuch,et al.  Entropy scaling and simulability by matrix product states. , 2007, Physical review letters.

[4]  Yaoyun Shi,et al.  Simulating Quantum Computation by Contracting Tensor Networks , 2005, SIAM J. Comput..

[5]  Jian-Wei Pan,et al.  Demonstration of a compiled version of Shor's quantum factoring algorithm using photonic qubits. , 2007, Physical review letters.

[6]  B. Lanyon,et al.  Experimental demonstration of a compiled version of Shor's algorithm with quantum entanglement. , 2007, Physical review letters.

[7]  D. Bruß,et al.  Lectures on Quantum Information , 2007 .

[8]  R. Prevedel,et al.  Experimental realization of Deutsch's algorithm in a one-way quantum computer. , 2006, Physical Review Letters.

[9]  Lee Spector.  The Power of Quantum Computing , 2007 .

[10]  H. Briegel,et al.  One-way Quantum Computation - a tutorial introduction , 2006, quant-ph/0603226.

[11]  Robert Spalek,et al.  Quantum Fan-out is Powerful , 2005, Theory Comput..

[12]  Scott Aaronson,et al.  Quantum computing, postselection, and probabilistic polynomial-time , 2004, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[13]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[14]  David P. DiVincenzo,et al.  Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games , 2002, Quantum Inf. Comput..

[15]  Mikhail N. Vyalyi.  Hardness of approximating the weight enumerator of a binary linear code , 2003, ArXiv.

[16]  H. Briegel,et al.  Measurement-based quantum computation on cluster states , 2003, quant-ph/0301052.

[17]  Robert Spalek,et al.  Quantum Circuits with Unbounded Fan-out , 2002, STACS.

[18]  Leslie G. Valiant,et al.  Quantum Circuits That Can Be Simulated Classically in Polynomial Time , 2002, SIAM J. Comput..

[19]  I. Chuang,et al.  Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance , 2001, Nature.

[20]  R Raussendorf,et al.  A one-way quantum computer. , 2001, Physical review letters.

[21]  Richard Cleve,et al.  Fast parallel circuits for the quantum Fourier transform , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[22]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[23]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[24]  James G. Oxley,et al.  Matroid theory , 1992 .

[25]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .