Synthesis of Quantum Superpositions by Quantum Computation

Lov K. Grover
Phys. Rev. Lett. 85, 1334 – Published 7 August 2000
PDFExport Citation

Abstract

The quantum search algorithm can be looked at as a technique for synthesizing a particular kind of superposition—one whose amplitude is concentrated in a single basis state. This basis state is defined by a binary function f(x¯) that is nonzero in this desired basis state and zero everywhere else. This paper extends the quantum search algorithm to an algorithm that can create an arbitrarily specified superposition on a space of size N in O(N) steps. The superposition is specified by a complex valued function f(x¯) that specifies the desired amplitude of the system in basis state x¯.

  • Received 18 February 2000

DOI:https://doi.org/10.1103/PhysRevLett.85.1334

©2000 American Physical Society

Authors & Affiliations

Lov K. Grover*

  • Bell Labs, Lucent Technologies, 600–700 Mountain Avenue, Murray Hill, New Jersey 07974

  • *Electronic address: lkgrover@bell-labs.com

References (Subscription Required)

Click to Expand
Issue

Vol. 85, Iss. 6 — 7 August 2000

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×