Published January 30, 2006
| Version v1
Journal article
Reducing execution time of quantum algorithms by additional permutation gates
Creators
- 1. Department of Physics, Kinki University, Higashi-Osaka 577-8502 (Japan)
- 2. Low Temperature Laboratory, POB 3500, FIN-02015 HUT, Helsinki University of Technology (Finland)
- 3. Graduate School of Engineering, Osaka City University, Osaka 558-8585 (Japan)
Description
For a given quantum algorithm the time-optimal implementation is attained using the Cartan decomposition. We extend this approach and show that the execution time of a quantum algorithm can be further reduced by adding an extra gate to it. We apply this method to Grover's algorithm and show that the execution time is halved
Additional details
Identifiers
- DOI
- 10.1016/j.physleta.2005.10.002;
- PII
- S0375-9601(05)01538-0;
Publishing Information
- Journal Title
- Physics Letters. A
- Journal Volume
- 350
- Journal Issue
- 1-2
- Journal Page Range
- p. 27-30
- ISSN
- 0375-9601
- CODEN
- PYLAAG
INIS
- Country of Publication
- Netherlands
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 37066226
- Subject category
- S71: CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS;
- Descriptors DEI
- ALGORITHMS; NUCLEAR MAGNETIC RESONANCE; OPTIMAL CONTROL; QUANTUM COMPUTERS; QUANTUM INFORMATION; QUANTUM MECHANICS
- Descriptors DEC
- COMPUTERS; CONTROL; INFORMATION; MAGNETIC RESONANCE; MATHEMATICAL LOGIC; MECHANICS; RESONANCE
Optional Information
- Copyright
- Copyright (c) 2005 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.