Efficient state preparation for a register of quantum bits

Simple item page
dc.creatorSoklakov, Andrei N.
dc.creatorSchack, Ruediger
dc.date2004-08-06
dc.date2005-11-22
dc.date.accessioned2026-07-07T06:40:43Z
dc.date.available2026-07-07T06:40:43Z
dc.descriptionWe describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably bounded amplitudes, the algorithm requires resources that are polynomial in the number of qubits. Such sequences of states occur naturally in the problem of encoding a classical probability distribution in a quantum register.
dc.description26 pages, 3 figures, extended version
dc.identifierhttps://arxiv.org/abs/quant-ph/0408045
dc.identifierhttp://arxiv.org/abs/quant-ph/0408045
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/101467
dc.subjectQuantum Physics
dc.titleEfficient state preparation for a register of quantum bits
dc.typetext

Files

Collections

arXiv