Efficient state preparation for a register of quantum bits

2004/08/06 by Andrei N. Soklakov, Soklakov, Andrei N., Ruediger Schack +1 · 3 citations
Computer Science · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph)

paper · pdf · doi:10.48550/arxiv.quant-ph/0408045

openalex publication_date 2004/08/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We 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.

Cited by

• Toward end-to-end quantum simulation of rapidly distorted turbulence
• Quantum Algorithm of the GLMY Homology on Digraphs
• A simpler Gaussian state-preparation

Related

• Grover search algorithm
• Efficient Implementation of a Quantum Search Algorithm for Arbitrary N
• Optimizing Quantum Search with a Binomial Version of Grover's Algorithm
• Quantum Algorithm for Binary Vector Encoding and Retrieval Utilizing the Permutation Trick
• Quantum Computers and Unstructured Search: Finding and Counting Items with an Arbitrarily Entangled Initial State