skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Improving the performance of probabilistic programmable quantum processors

Abstract

We present a systematic analysis of how one can improve performance of probabilistic programmable quantum processors. We generalize a simple Vidal-Masanes-Cirac processor that realizes U(1) rotations on a qubit with the phase of the rotation encoded in a state of the program register. We show how the probability of success of the probabilistic processor can be enhanced by using the processor in loops. In addition we show that the same strategy can be utilized for a probabilistic implementation of nonunitary transformations on qubits. In addition, we show that an arbitrary SU(2) transformation of qubits can be encoded in program state of a universal programmable probabilistic quantum processor. The probability of success of this processor can be enhanced by a systematic correction of errors via conditional loops. Finally, we show that all our results can be generalized also for qudits. In particular, we show how to implement SU(N) rotations of qudits via programmable quantum processor and how the performance of the processor can be enhanced when it is used in loops.

Authors:
 [1];  [2];  [2]
  1. Department of Physics, Hunter College of CUNY, 695 Park Avenue, New York, New York 10021 (United States)
  2. Research Center for Quantum Information, Slovak Academy of Sciences, Dubravska cesta 9, 845 11 Bratislava (Slovakia)
Publication Date:
OSTI Identifier:
20640957
Resource Type:
Journal Article
Journal Name:
Physical Review. A
Additional Journal Information:
Journal Volume: 69; Journal Issue: 4; Other Information: DOI: 10.1103/PhysRevA.69.042311; (c) 2004 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); Journal ID: ISSN 1050-2947
Country of Publication:
United States
Language:
English
Subject:
74 ATOMIC AND MOLECULAR PHYSICS; CORRECTIONS; ERRORS; IMPLEMENTATION; INFORMATION THEORY; PERFORMANCE; PROBABILISTIC ESTIMATION; PROBABILITY; QUANTUM MECHANICS; ROTATION; SU-2 GROUPS; TRANSFORMATIONS

Citation Formats

Hillery, Mark, Ziman, Mario, Buzek, Vladimir, and Faculty of Informatics, Masaryk University, Botanicka 68a, 602 00 Brno. Improving the performance of probabilistic programmable quantum processors. United States: N. p., 2004. Web. doi:10.1103/PhysRevA.69.042311.
Hillery, Mark, Ziman, Mario, Buzek, Vladimir, & Faculty of Informatics, Masaryk University, Botanicka 68a, 602 00 Brno. Improving the performance of probabilistic programmable quantum processors. United States. https://doi.org/10.1103/PhysRevA.69.042311
Hillery, Mark, Ziman, Mario, Buzek, Vladimir, and Faculty of Informatics, Masaryk University, Botanicka 68a, 602 00 Brno. 2004. "Improving the performance of probabilistic programmable quantum processors". United States. https://doi.org/10.1103/PhysRevA.69.042311.
@article{osti_20640957,
title = {Improving the performance of probabilistic programmable quantum processors},
author = {Hillery, Mark and Ziman, Mario and Buzek, Vladimir and Faculty of Informatics, Masaryk University, Botanicka 68a, 602 00 Brno},
abstractNote = {We present a systematic analysis of how one can improve performance of probabilistic programmable quantum processors. We generalize a simple Vidal-Masanes-Cirac processor that realizes U(1) rotations on a qubit with the phase of the rotation encoded in a state of the program register. We show how the probability of success of the probabilistic processor can be enhanced by using the processor in loops. In addition we show that the same strategy can be utilized for a probabilistic implementation of nonunitary transformations on qubits. In addition, we show that an arbitrary SU(2) transformation of qubits can be encoded in program state of a universal programmable probabilistic quantum processor. The probability of success of this processor can be enhanced by a systematic correction of errors via conditional loops. Finally, we show that all our results can be generalized also for qudits. In particular, we show how to implement SU(N) rotations of qudits via programmable quantum processor and how the performance of the processor can be enhanced when it is used in loops.},
doi = {10.1103/PhysRevA.69.042311},
url = {https://www.osti.gov/biblio/20640957}, journal = {Physical Review. A},
issn = {1050-2947},
number = 4,
volume = 69,
place = {United States},
year = {Thu Apr 01 00:00:00 EST 2004},
month = {Thu Apr 01 00:00:00 EST 2004}
}