Pith. sign in

REVIEW 4 cited by

An Efficient Quantum Circuit for Block Encoding a Pairing Hamiltonian

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 2402.11205 v3 pith:UQOQPVYL submitted 2024-02-17 nucl-th cs.NAmath.NAquant-ph

classification nucl-thcs.NAmath.NAquant-ph
keywords hamiltonianblockcircuitencodingquantumpairingefficientencode
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We present an efficient quantum circuit for block encoding pairing Hamiltonian often studied in nuclear physics. Our block encoding scheme does not require mapping the creation and annihilation operators to the Pauli operators and representing the Hamiltonian as a linear combination of unitaries. Instead, we show how to encode the Hamiltonian directly using controlled swap operations. We analyze the gate complexity of the block encoding circuit and show that it scales polynomially with respect to the number of qubits required to represent a quantum state associated with the pairing Hamiltonian. We also show how the block encoding circuit can be combined with the quantum singular value transformation to construct an efficient quantum circuit for approximating the density of states of a pairing Hamiltonian. The techniques presented can be extended to encode more general second-quantized Hamiltonians.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. High-order Magnus Expansion for Hamiltonian Simulation

    quant-ph 2025-09 conditional novelty 7.0 of 10

    Arbitrary-order Magnus expansion is shown to have commutator-scaling error bounds and a polynomial-cost quantum circuit, yielding a time-dependent Hamiltonian simulation algorithm with O~(αbar^{1+1/p} T^{1+1/p}/ε^{1/p...

  2. Quantum Channel Polynomial Processing

    quant-ph 2026-07 conditional novelty 6.0 of 10

    QCPP implements polynomial transformations of Hamiltonians via stochastic mixtures of unitary channels, achieving a tunable tradeoff between query and sample complexity.

  3. Ab initio many-fermion structure calculations on a quantum computer

    nucl-th 2025-05 conditional novelty 6.0 of 10

    A quantum-classical resolvent method with a new fermionic block-encoding input scheme computes the spectrum and J values of 20O in a truncated sd-shell space, matching classical diagonalization.

  4. Efficient Quantum Simulation of QCD Jets on the Light Front

    hep-ph 2024-11 conditional novelty 6.0 of 10

    A direct second-quantized qubit encoding of the light-front QCD Hamiltonian is used to classically emulate in-medium jet evolution with up to three-particle Fock states.

Pith tools