Discrete Wigner functions and the phase space representation of quantum computers
We show how to represent the state and the evolution of a quantum computer (or any system with an N-dimensional Hilbert space) in phase space. For this purpose we use a discrete version of the Wigner function which, for arbitrary N, is defined in a phase space grid of 2N × 2N points. We compute such...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_03759601_v297_n5-6_p353_Bianucci |
| Aporte de: |
| Sumario: | We show how to represent the state and the evolution of a quantum computer (or any system with an N-dimensional Hilbert space) in phase space. For this purpose we use a discrete version of the Wigner function which, for arbitrary N, is defined in a phase space grid of 2N × 2N points. We compute such Wigner function for states which are relevant for quantum computation. Finally, we discuss properties of quantum algorithms in phase space and present the phase space representation of Grover’s quantum search algorithm. © 2002 Elsevier Science Ltd. All rights reserved. |
|---|