Temporally unstructured quantum computation

DOI10.1098/rspa.2008.0443zbMath1186.81042arXiv0809.0847OpenAlexW2097087591MaRDI 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 matroidsquantum algorithmquantum computational complexityabelian dynamics

Mathematics Subject Classification ID

Computational learning theory (68Q32) Applications of game theory (91A80) Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (12)

Constant-round blind classical verification of quantum sampling ⋮ The complexity of approximating complex-valued Ising and Tutte partition functions ⋮ Commuting quantum circuits and complexity of Ising partition functions ⋮ Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ ⋮ Unnamed Item ⋮ A framework for phase and interference in generalized probabilistic theories ⋮ Generating a statet-design by diagonal quantum circuits ⋮ DIAGONAL-UNITARY 2-DESIGN AND THEIR IMPLEMENTATIONS BY QUANTUM CIRCUITS ⋮ Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy ⋮ Verification of quantum computation: an overview of existing approaches ⋮ Towards quantum computing based community detection ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits

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

This page was built for publication: Temporally unstructured quantum computation