The One Way to Quantum Computation
From MaRDI portal
Publication:3591401
DOI10.1007/11787006_2zbMath1133.68342OpenAlexW1533921300MaRDI QIDQ3591401
Vincent Danos, Elham Kashefi, Prakash Panangaden
Publication date: 11 September 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11787006_2
Related Items (8)
A programming language characterizing quantum polynomial time ⋮ Unnamed Item ⋮ Can a Quantum Computer Run the von Neumann Architecture? ⋮ On weak odd domination and graph-based quantum secret sharing ⋮ Measurement-Based and Universal Blind Quantum Computation ⋮ Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation ⋮ Reversibility in Extended Measurement-Based Quantum Computation ⋮ Quadratic Form Expansions for Unitaries
This page was built for publication: The One Way to Quantum Computation
