Pith. sign in

REVIEW

Black-Box Quantum State Preparation with Inverse Coefficients

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.05937 v1 pith:SK4AUDJ6 submitted 2021-12-11 quant-ph

Black-Box Quantum State Preparation with Inverse Coefficients

classification quant-ph
keywords algorithmblack-boxpreparationquantumstatealgorithmscoefficientserror
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Black-box quantum state preparation is a fundamental building block for many higher-level quantum algorithms, which is applied to transduce the data from computational basis into amplitude. Here we present a new algorithm for performing black-box state preparation with inverse coefficients based on the technique of inequality test. This algorithm can be used as a subroutine to perform the controlled rotation stage of the Harrow-Hassidim-Lloyd (HHL) algorithm and the associated matrix inversion algorithms with exceedingly low cost. Furthermore, we extend this approach to address the general black-box state preparation problem where the transduced coefficient is a general non-linear function. The present algorithm greatly relieves the need to do arithmetic and the error is only resulted from the truncated error of binary string. It is expected that our algorithm will find wide usage both in the NISQ and fault-tolerant quantum algorithms.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.