Quantum and classical parallelism in parity algorithms for ensemble quantum computers

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@Article{Stadelhofer:2005:PhysRevA,

• author = "Ralf Stadelhofer and Dieter Suter and Wolfgang Banzhaf",
• title = "Quantum and classical parallelism in parity algorithms for ensemble quantum computers",
• journal = "Physical Review A",
• year = "2005",
• volume = "71",
• number = "3",
• pages = "032345--1--032345--6",
• month = mar,
• keywords = "genetic algorithms, genetic programming, quantum computing",
• ISSN = "2469-9926",
• DOI = "doi:10.1103/PhysRevA.71.032345",
• size = "6 pages",
• abstract = "The determination of the parity of a string of N binary digits is a well-known problem in classical as well as quantum information processing, which can be formulated as an oracle problem. It has been established that quantum algorithms require at least N∕2 oracle calls. We present an algorithm that reaches this lower bound and is also optimal in terms of additional gate operations required. We discuss its application to pure and mixed states. Since it can be applied directly to thermal states, it does not suffer from signal loss associated with pseudo-pure-state preparation. For ensemble quantum computers, the number of oracle calls can be further reduced by a factor 2**k, with k in {1,2,..,log2(N∕2)}, provided the signal-to-noise ratio is sufficiently high. This additional speed-up is linked to (classical) parallelism of the ensemble quantum computer. Experimental realizations are demonstrated on a liquid-state NMR quantum computer.",
• notes = "American Physical Society",

}

Genetic Programming entries for Ralf Stadelhofer Dieter Suter Wolfgang Banzhaf

Citations