Efficient Quantum Circuits based on the Quantum Natural Gradient
Ananda Roy, Sameer Erramilli, Robert M. Konik

TL;DR
This paper introduces symmetry-conserving quantum circuits optimized with the quantum natural gradient, enabling efficient state preparation with depth depending on entanglement rather than system size, beneficial for near-term quantum applications.
Contribution
The paper proposes SCom-QAOA circuits that preserve symmetries and optimize their parameters using the quantum natural gradient, reducing circuit depth dependence on system size for certain states.
Findings
Circuit depth depends on entanglement, not system size.
High fidelity states (>99%) achieved with sub-system-size depth.
Enables broader initial state preparation for variational algorithms.
Abstract
Efficient preparation of arbitrary entangled quantum states is crucial for quantum computation. This is particularly important for noisy intermediate scale quantum simulators relying on variational hybrid quantum-classical algorithms. To that end, we propose symmetry-conserving modified quantum approximate optimization algorithm~(SCom-QAOA) circuits. The depths of these circuits depend not only on the desired fidelity to the target state, but also on the amount of entanglement the state contains. The parameters of the SCom-QAOA circuits are optimized using the quantum natural gradient method based on the Fubini-Study metric. The SCom-QAOA circuit transforms an unentangled state into a ground state of a gapped one-dimensional Hamiltonian with a circuit-depth that depends not on the system-size, but rather on the finite correlation length. In contrast, the circuit depth grows…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography
