We have 3 of 18 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
A simpler algebraic decomposition is proposed to separate the preparation of the real part of the desired state from the complex one, resulting in a reduction in terms of circuit depth, total gates, and CNOT count when 𝑚 ancillary qubits are available.
This work proposes a novel algorithm structured on Lie algebras for the approximate quantum state preparation problem, achieving high accuracy of up to 4 qubits in simulation, but also its current limitations with an increasing number of qubits.
In this work, a quantum architecture search framework for approximate quantum state preparation (QSP) is proposed, able to achieve approximation errors of $10^{-14}$.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
