Pith. sign in

REVIEW 2 cited by

State preparation based on quantum phase estimation

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 1912.05335 v1 pith:I5QBXFJL submitted 2019-12-11 quant-ph

classification quant-ph
keywords preparationstatequantumalgorithmalgorithmsdiagonalestimationoperators
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

State preparation is a process encoding the classical data into the quantum systems. Based on quantum phase estimation, we propose the specific quantum circuits for a deterministic state preparation algorithm and a probabilistic state preparation algorithm. To discuss the gate complexity in these algorithms, we decompose the diagonal unitary operators included in the phase estimation algorithms into the basic gates. Thus, we associate the state preparation problem with the decomposition problem of the diagonal unitary operators. We analyse the fidelities in the two algorithms and discuss the success probability in the probabilistic algorithm. In this case, we explain that the efficient decomposition of the corresponding diagonal unitary operators is the sufficient condition for state preparation problems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Tower of Structured Excited States from Measurements

    quant-ph 2024-11 conditional novelty 7.0 of 10

    A phase-estimation measurement of a global charge or momentum projects an easy-to-prepare matrix product state onto towers of quantum many-body scar states and Dicke states in logarithmic circuit depth.

  2. Tensor-Based Binary Graph Encoding for Variational Quantum Classifiers

    quant-ph 2025-01 reject novelty 6.0 of 10

    A tensor-based binary encoding maps graph vertices and edges to Pauli-Z strings for variational quantum classifiers, and simulations on three datasets show accuracy gains over a PCA-based baseline, with several unaddr...

Pith tools