Home | About Journal | Web Links | E-mail Alerts | RSS RSS Icon | Browse
Previous Article Next Article

Quantum counting algorithm and its application in mesoscopic physics

Source: Phys. Rev. A 82, 012316 (2010); doi:10.1103/PhysRevA.82.012316

Published 16 July 2010

PACS
  • 03.67.Ac
    Quantum algorithms, protocols and simulations
  • 03.67.Bg
    Entanglement production and manipulation (quantum information)
  • 73.23.-b
    Electronic transport in mesoscopic systems
  • YEAR: 2010
PUBLICATION DATA
Publisher:
AIP is a member of CrossRef APS
G. B. Lesovik,1,2 M. V. Suslov,3,4 and G. Blatter2
1L. D. Landau Institute for Theoretical Physics RAS, 117940 Moscow, Russia
2Theoretische Physik, ETH-Zurich, CH-8093 Zürich, Switzerland
3Moscow Institute of Physics and Technology, Institutskii per. 9, 141700 Dolgoprudny, Moscow District, Russia
4NIX Computer Company, R&D Department, Zvezdniy Boulevard 19, 129085 Moscow, Russia

We discuss a quantum counting algorithm which transforms a physical particle-number state (and superpositions thereof) into a binary number. The algorithm involves two quantum Fourier transformations. One transformation is in physical space, where a stream of n<N=2K (charged) particles is coupled to K qubits, rotating their states by prescribed angles. The second transformation is within the Hilbert space of qubits and serves to read out the particle number in a binary form. Applications include a divisibility check characterizing the size of a finite train of particles in a quantum wire and a scheme allowing one to entangle multiparticle wave functions in a Mach-Zehnder interferometer, generating Bell, Greenberger-Horne-Zeilinger, or Dicke states. ©2010 The American Physical Society
History: Received 2 April 2010; published 16 July 2010
Permalink: http://link.aps.org/abstract/PRA/v82/e012316
ADVERTISEMENT