Preparing Many Copies of a Quantum State in the Black-Box Model

07/22/2022
by   Yassine Hamoudi, et al.
0

We describe a simple quantum algorithm for preparing K copies of an N-dimensional quantum state whose amplitudes are given by a quantum oracle. Our result extends a previous work of Grover, who showed how to prepare one copy in time O(√(N)). In comparison with the naive O(K√(N)) solution obtained by repeating this procedure K times, our algorithm achieves the optimal running time of θ(√(KN)). Our technique uses a refinement of the quantum rejection sampling method employed by Grover. As a direct application, we obtain a similar speed-up for obtaining K independent samples from a distribution whose probability vector is given by a quantum oracle.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2021

Quantum Oracle Separations from Complex but Easily Specified States

A foundational question in quantum computational complexity asks how muc...
research
08/20/2020

The Quantum Supremacy Tsirelson Inequality

A leading proposal for verifying near-term quantum supremacy experiments...
research
09/22/2020

Fast Black-Box Quantum State Preparation

Quantum state preparation is an important ingredient for other higher-le...
research
12/01/2022

Quantum Cryptography in Algorithmica

We construct a classical oracle relative to which 𝖯 = 𝖭𝖯 yet single-copy...
research
02/15/2018

Learning DNFs under product distributions via μ-biased quantum Fourier sampling

We show that DNF formulae can be quantum PAC-learned in polynomial time ...
research
04/20/2020

Quantum Copy-Protection from Hidden Subspaces

Quantum copy-protection is an innovative idea that uses the no-cloning p...
research
05/10/2023

Novel Quantum Information Processing Methods and Investigation

Quantum information processing and its subfield, quantum image processin...

Please sign up or login with your details

Forgot password? Click here to reset