Pith. sign in

REVIEW 5 cited by

Ground States via Spectral Combing on a Quantum Computer

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 1709.08250 v1 pith:5JMLQKJW submitted 2017-09-24 quant-ph hep-latnucl-th

classification quant-phhep-latnucl-th
keywords quantumalgorithmcombingcomputerfunctiongroundinitialqubits
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A new method is proposed for determining the ground state wave function of a quantum many-body system on a quantum computer, without requiring an initial trial wave function that has good overlap with the true ground state. The technique of Spectral Combing involves entangling an arbitrary initial wave function with a set of auxiliary qubits governed by a time dependent Hamiltonian, resonantly transferring energy out of the initial state through a plethora of avoided level crossings into the auxiliary system. The number of avoided level crossings grows exponentially with the number of qubits required to represent the Hamiltonian, so that the efficiency of the algorithm does not rely on any particular energy gap being large. We give an explicit construction of the quantum gates required for the realization of this procedure and explore the results of classical simulations of the algorithm on a small quantum computer with up to 8 qubits. We show that for certain systems and comparable results, Spectral Combing requires fewer quantum gates to realize than the Quantum Adiabatic Algorithm.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

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

  1. Super-bath Quantum Eigensolver

    quant-ph 2024-12 conditional novelty 7.0 of 10

    The authors propose the super-bath quantum eigensolver (SQE), a dissipation-based quantum algorithm that prepares ground states with polynomial resources whenever a physical sub-bath exists, and provide a rigorous err...

  2. The application of annealing in quantum cooling protocols

    quant-ph 2025-01 conditional novelty 6.0 of 10

    Adding an annealing schedule that gradually lowers the bath-system coupling improves ground state cooling fidelity and efficiency in a transverse field Ising model.

  3. Engineered thermalization and cooling of quantum many-body systems

    quant-ph 2019-09 conditional novelty 6.0 of 10

    Periodically swept, Boltzmann-populated ancilla qubits can drive a general spin Hamiltonian's populations toward the Gibbs state, with accuracy set by a detailed-balance violation metric.

  4. Parton Physics on a Quantum Computer

    hep-lat 2019-08 conditional novelty 6.0 of 10

    A quantum-computer algorithm is proposed for computing parton distribution functions and hadronic tensors, with a Thirring-model demonstration and QCD resource estimates that favor extracting PDFs by fitting the hadro...

  5. Noise-Induced Thermalization in Quantum Systems

    quant-ph 2025-12 conditional novelty 5.0 of 10

    Interleaving random or phase-flip noise with Hamiltonian evolution accelerates—and for integrable chains enables—local convergence to Gibbs states in small spin-chain simulations.

Pith tools