REVIEW 9 cited by
Efficient calculation of gradients in classical simulations of variational quantum algorithms
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
Efficient calculation of gradients in classical simulations of variational quantum algorithms
read the original abstract
Calculating the energy gradient in parameter space has become an almost ubiquitous subroutine of variational near-term quantum algorithms. "Faithful" classical emulation of this subroutine mimics its quantum evaluation, and scales as O(P^2) gate operations for P variational parameters. This is often the bottleneck for the moderately-sized simulations, and has attracted HPC strategies like "batch-circuit" evaluation. We here present a novel derivation of an emulation strategy to precisely calculate the gradient in O(P) time and using O(1) state-vectors, compatible with "full-state" state-vector simulators. The prescribed algorithm resembles the optimised technique for automatic differentiation of reversible cost functions, often used in classical machine learning, and first employed in quantum simulators like Yao.jl. In contrast, our scheme derives directly from a recurrent form of quantum operators, and may be more familiar to a quantum computing community. Our strategy is very simple, uses only 'apply gate', 'clone state' and 'inner product' primitives and is hence straightforward to implement and integrate with existing simulators. It is compatible with gate parallelisation schemes, and hardware accelerated and distributed simulators. We describe the scheme in an instructive way, including details of how common gate derivatives can be performed, to clearly guide implementation in existing quantum simulators. We furthermore demonstrate the scheme by implementing it in Qiskit, and perform some comparative benchmarking with faithful simulation. Finally, we remark upon the difficulty of extending the scheme to density-matrix simulation of noisy channels.
Forward citations
Cited by 9 Pith papers
-
Graph-Conditioned Meta-Optimizer for QAOA Parameter Generation on Multiple Problem Classes
A graph-conditioned meta-optimizer learns QAOA parameter trajectories from one problem class and transfers them to others, yielding better initializations than standard methods in an empirical study of 64 settings.
-
Quantum Hypergraph Partitioning
QAOA produces distributional solutions for hypergraph partitioning that outperform classical SDP approximations on fairness-style objectives like greatest expected imbalance.
-
Hardware-Efficient Hamiltonian Simulation via Trotter-Initialized Variational Optimization with Native Placement
Structure-aware approximate compilation for Hamiltonian dynamics on NISQ devices produces shallower circuits with higher observed fidelity than generic exact synthesis.
-
Fast and memory-efficient classical simulation of quantum machine learning via forward and backward gate fusion
Gate fusion applied to both forward and backward passes in quantum circuit simulation achieves 20-30x throughput gains and supports training large 20-qubit 1000-layer QML models with 60000 parameters using gradient ch...
-
PennyLane: Automatic differentiation of hybrid quantum-classical computations
PennyLane is a software library extending automatic differentiation to hybrid quantum-classical systems for variational quantum algorithms.
-
Learning Low-Energy Subspace Overlaps in Many-Body Systems with Measurement-Based and Coherent Quantum Strategies
Compares shadow-based CNNs and physics-informed QCNNs for predicting low-energy subspace overlaps in quenched 10-qubit Heisenberg chains, reporting regime-dependent R^2 performance with QCNNs more stable overall.
-
Learning Cut Distributions with Quantum Optimization
QAOA ansatz with finite layers can capture any bitstring distribution and solves the Fair Cut Cover problem with provable and empirical advantages over classical approximations on certain graphs.
-
Hybrid Quantum-HPC Middleware Systems for Adaptive Resource, Workload and Task Management
The authors present Pilot-Quantum, a middleware for adaptive resource management in hybrid quantum-HPC systems, along with execution motifs and a performance modeling toolkit called Q-Dreamer.
-
PauliEngine: High-Performant Symbolic Arithmetic for Quantum Operations
PauliEngine delivers a high-performance C++ backend for Pauli string multiplication, commutators, and symbolic tracking that outperforms existing tools in benchmarks.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.