Quantum computers in phase space
Cesar Miquel, Juan Pablo Paz, Marcos Saraceno
Abstract
We represent both the states and the evolution of a quantum computer in phase space using the discrete Wigner function. We study properties of the phase space representation of quantum algorithms: apart from analyzing important examples, such as the Fourier Transform and Grover's search, we examine the conditions for the existence of a direct correspondence between quantum and classical evolutions in phase space. Finally, we describe how to directly measure the Wigner function in a given phase space point by means of a tomographic method that, itself, can be interpreted as a simple quantum algorithm.
Create a lesson
Related papers
Comment on "Supervised Learning with Quantum Hamiltonian Embeddings" (arXiv:2610.26833)
Alexander G. Abanov, Luca Candelori, Kharen Musaelian
Data informed Ansatz Selection for Variational Quantum Circuits
Manav Seksaria, Advith Desu, Anil Prabhakar
Operational Thresholds for Long-Range Entanglement in Quantum Networks
Arn Caesar, Xinqi Hu, Kim Christensen
QECert: Formal Foundations for Quantum Error-Correction Theory in Lean
Keming He, Jiahan Chen, Enji Xiong et al.
Reopening the one clean qubit case of a semi-grand challenge
Christopher W. Mansell
Recoverability of Gravitational Entanglement under Decoherence
Yi-Xuan Wang, Julen S. Pedernales, Martin B. Plenio