Temporally unstructured quantum computation

DOI10.1098/rspa.2008.0443zbMath1186.81042arXiv0809.0847MaRDI QIDQ3561913

D. J. Shepherd, Michael J. Bremner

Publication date: 19 May 2010

Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.0847

zbMATH Keywords

binary matroids; quantum algorithm; quantum computational complexity; abelian dynamics

Mathematics Subject Classification ID

68Q32: Computational learning theory

91A80: Applications of game theory

81P68: Quantum computation

81P45: Quantum information, communication, networks (quantum-theoretic aspects)

Related Items

DIAGONAL-UNITARY 2-DESIGN AND THEIR IMPLEMENTATIONS BY QUANTUM CIRCUITS, The complexity of approximating complex-valued Ising and Tutte partition functions, Verification of quantum computation: an overview of existing approaches, Quantum Homomorphic Encryption for Polynomial-Sized Circuits, Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$, Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy

Cites Work

• Entropy Scaling and Simulability by Matrix Product States
• Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer
• Matchgates and classical simulation of quantum circuits
• Quantum computing, postselection, and probabilistic polynomial-time