QCPP implements polynomial transformations of Hamiltonians via stochastic mixtures of unitary channels, achieving a tunable tradeoff between query and sample complexity.
An efficient quantum circuit for block encoding a pairing Hamilto- nian
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
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.
fields
quant-ph 2years
2026 2representative citing papers
TARE block-encodes sums of Pauli strings with reduced T-gate count and improved circuit depth versus standard LCU by leveraging mutually anti-commuting Pauli sets and transformations.
citing papers explorer
-
Quantum Channel Polynomial Processing
QCPP implements polynomial transformations of Hamiltonians via stochastic mixtures of unitary channels, achieving a tunable tradeoff between query and sample complexity.
-
TARE: Block Encoding Linear Combinations of Pauli Strings Without Ancilla State Preparation
TARE block-encodes sums of Pauli strings with reduced T-gate count and improved circuit depth versus standard LCU by leveraging mutually anti-commuting Pauli sets and transformations.