QUANTUM SOFTWARE REUSABILITY

DOI10.1142/S0129054103002023zbMath1101.68584arXivquant-ph/0309121MaRDI QIDQ5696938

Andreas Klappenecker, Martin Roetteler

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0309121

zbMATH Keywords

teleportationcirculant matricesquantum circuitsunitary error basesquantum signal transforms

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Theory of software (68N99)

Related Items (6)

The Birkhoff theorem for unitary matrices of arbitrary dimensions ⋮ Quantum fast Poisson solver: the algorithm and complete and modular circuit design ⋮ The decomposition of an arbitrary \(2^w \times 2^w\) unitary matrix into signed permutation matrices ⋮ A Birkhoff Connection Between Quantum Circuits and Linear Classical Reversible Circuits ⋮ The Birkhoff theorem for unitary matrices of prime-power dimension ⋮ A characterization of orthogonal permutative matrices of order 4

Cites Work

• Teleportation as a quantum computation.
• The discrete fractional Fourier transform
• Quantum algorithms and the Fourier transform
• Quantum algorithms revisited
• Quantum computations: algorithms and error correction
• Beyond stabilizer codes .I. Nice error bases
• Unnamed Item
• Unnamed Item

This page was built for publication: QUANTUM SOFTWARE REUSABILITY