REVIEW 2 cited by
A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
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
read the original abstract
We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms which use the Unitary Coupled Cluster (UCC) ansatz, designed to reduce circuit depth and gate count. This is achieved by partitioning Pauli exponential terms into mutually commuting sets. These sets are then diagonalised using Clifford circuits and synthesised using the phase polynomial formalism. This strategy reduces cx depth by 75.4% on average, and by up to 89.9%, compared to naive synthesis for a variety of molecules, qubit encodings and basis sets.
Forward citations
Cited by 2 Pith papers
-
COSMA: Communication-aware Optimization of Fermionic Simulation Kernels for Modular Quantum Architectures
COSMA jointly optimizes fermion-to-qubit mapping, Pauli scheduling, and multi-core allocation, cutting inter-core transfer cost by up to 2.5× (median ~1.7×) on molecular Trotter kernels.
-
Quantum-Classical Auxiliary Field Quantum Monte Carlo with Matchgate Shadows on Trapped Ion Quantum Computers
The largest quantum-classical AFQMC run to date, with a 16-qubit trial state on IonQ Forte, estimates a nickel reaction barrier within ±4 kcal/mol of CCSD(T) on an ideal simulator, but is 10 kcal/mol off with a revers...
Discussion (0). Continue with ORCID to comment.