A hardware-efficient binary-tree ansatz has a closed-form diagonal Fubini–Study metric, enabling metric-aware VQE and time evolution without auxiliary circuits, with linear-in-k pruning for sparse sectors.
SIAM Journal on Computing 31(4), 1229–1254 (2002)
4 Pith papers cite this work, alongside 327 external citations. Polarity classification is still indexing.
4
Pith papers citing it
327
external citations · OpenAlex
fields
quant-ph 4representative citing papers
Constructs free-fermion subsystem codes with a 2D topological example, graph-based solvability algorithm, and gap analysis via skew energy and median eigenvalues.
A necessary condition for variational quantum circuits to reach exact ground states requires matching module projection norms between input and solution, enabling classical O(n^5) exact solvers for problems like MaxCut.
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.
citing papers explorer
-
A hardware-efficient variational ansatz with an exact diagonal metric for real- and imaginary-time evolution and Haar sampling
A hardware-efficient binary-tree ansatz has a closed-form diagonal Fubini–Study metric, enabling metric-aware VQE and time evolution without auxiliary circuits, with linear-in-k pruning for sparse sectors.
-
Free-Fermion Subsystem Codes
Constructs free-fermion subsystem codes with a 2D topological example, graph-based solvability algorithm, and gap analysis via skew energy and median eigenvalues.
-
Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module
A necessary condition for variational quantum circuits to reach exact ground states requires matching module projection norms between input and solution, enabling classical O(n^5) exact solvers for problems like MaxCut.
-
Maximum Likelihood Decoding of Quantum Error Correction Codes
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.