pith. machine review for the scientific record. sign in

arxiv: 1304.3061 · v1 · submitted 2013-04-10 · 🪐 quant-ph · physics.chem-ph

Recognition: unknown

A variational eigenvalue solver on a quantum processor

Authors on Pith no claims yet
classification 🪐 quant-ph physics.chem-ph
keywords quantumapproachalgorithmcoherentcomputerconventionalefficientlyeigenvalue
0
0 comments X
read the original abstract

Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. For quantum systems, where the dimension of the problem space grows exponentially, finding the eigenvalues of certain operators is one such intractable problem and remains a fundamental challenge. The quantum phase estimation algorithm can efficiently find the eigenvalue of a given eigenvector but requires fully coherent evolution. We present an alternative approach that greatly reduces the requirements for coherent evolution and we combine this method with a new approach to state preparation based on ans\"atze and classical optimization. We have implemented the algorithm by combining a small-scale photonic quantum processor with a conventional computer. We experimentally demonstrate the feasibility of this approach with an example from quantum chemistry: calculating the ground state molecular energy for He-H+, to within chemical accuracy. The proposed approach, by drastically reducing the coherence time requirements, enhances the potential of the quantum resources available today and in the near future.

This paper has not been read by Pith yet.

discussion (0)

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

Forward citations

Cited by 3 Pith papers

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

  1. Universality of Quantum Gates in Particle and Symmetry Constrained Subspaces

    quant-ph 2026-05 unverdicted novelty 6.0

    Hardware-efficient gates are universal for state preparation in particle-number and symmetry-constrained subspaces because commutators generate Pauli Z projectors that span the full so(w) and su(w) algebras.

  2. Effective Noise Mitigation via Quantum Circuit Learning in Quantum Simulation of Integrable Spin Chains

    quant-ph 2026-04 unverdicted novelty 6.0

    A learned shallow circuit trained on conserved charges and limited dynamics preserves observables better than direct noisy simulation of deeper circuits in integrable spin chain models.

  3. Frustration-Induced Expressibility Limitations in Variational Quantum Algorithms

    quant-ph 2026-04 unverdicted novelty 5.0

    Geometric frustration in a square-lattice Ising model with diagonal couplings produces strongly inhomogeneous correlations that standard Hamiltonian-inspired variational ansatze cannot capture efficiently, increasing ...