REVIEW 4 cited by
Quantum state preparation without coherent arithmetic
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
read the original abstract
We introduce a versatile method for preparing a quantum state whose amplitudes are given by some known function. Unlike existing approaches, our method does not require handcrafted reversible arithmetic circuits, or quantum table reads, to encode the function values. Instead, we use a template quantum eigenvalue transformation circuit to convert a low cost block encoding of the sine function into the desired function. Our method uses only 4 ancilla qubits (3 if the approximating polynomial has definite parity), providing order-of-magnitude qubit count reductions compared to state-of-the-art approaches, while using a similar number of gates if the function can be well represented by a polynomial or Fourier approximation. Like black-box methods, the complexity of our approach depends on the 'L2-norm filling-fraction' of the function. We demonstrate the algorithmic utility of our method, including preparing Gaussian and Kaiser window states.
Forward citations
Cited by 4 Pith papers
-
Optimal quantum simulation of linear non-unitary dynamics
A query-optimal quantum algorithm for non-unitary linear dynamics using generalized LCHS with approximate exponential-decay kernels and exponentially convergent uniform quadrature.
-
Quantum phase estimation with optimal confidence interval using three control qubits
A DPSS control state for optimal-confidence quantum phase estimation can be approximated by a bond-dimension-4 matrix product state and prepared with only three recycling control qubits.
-
A framework for robust quantum speedups in practical correlated electronic structure and dynamics
A framework derives polynomial quantum speedups, up to Lc^18 for crystalline tri-exciton BSE and d^3 Lc^15 for linearized coupled cluster, in the regime where classical heuristics are accurate.
-
Qubit-Efficient Quantum Algorithm for Linear Differential Equations
A single-ancilla postselection algorithm solves dissipative linear ODEs with first-order error bounds and locality-preserving circuit structure.
Discussion (0). Sign in to comment.