Using a single circuit to compute the gradients with respect to all parameters of a quantum neural network

Finding gradients is a crucial step in training machine learning models. For quantum neural networks, computing gradients using the parameter-shift rule requires calculating the cost function twice for each adjustable parameter in the network. When the total number of parameters is large, the quantum circuit must be repeatedly adjusted and executed, leading to significant computational overhead. Here, we propose an approach to compute all gradients using only a single circuit, significantly reducing both the circuit depth and the number of classical registers required. Although the theoretical complexity of gradient calculation and the total number of measurements are not reduced by this approach, a considerable reduction in the number of unique circuit compilations and job submissions is achieved. We experimentally validate our approach on both quantum simulators and IBM’s real quantum hardware, demonstrating that our method significantly reduces circuit compilation time compared to the conventional approach, resulting in a substantial speedup in total runtime.

Authors

Publication Details

Journal
Frontiers of Physics
Published
2026-01-01
DOI
https://doi.org/10.15302/frontphys.2026.083201
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Using a single circuit to compute the gradients with respect to all parameters of a quantum neural network

Guang Ping He
Frontiers of Physics
Quantum Computing Algorithms and Architecture
article

Using a single circuit to compute the gradients with respect to all parameters of a quantum neural network

Guang Ping He
article en

Abstract

Finding gradients is a crucial step in training machine learning models. For quantum neural networks, computing gradients using the parameter-shift rule requires calculating the cost function twice for each adjustable parameter in the network. When the total number of parameters is large, the quantum circuit must be repeatedly adjusted and executed, leading to significant computational overhead. Here, we propose an approach to compute all gradients using only a single circuit, significantly reducing both the circuit depth and the number of classical registers required. Although the theoretical complexity of gradient calculation and the total number of measurements are not reduced by this approach, a considerable reduction in the number of unique circuit compilations and job submissions is achieved. We experimentally validate our approach on both quantum simulators and IBM’s real quantum hardware, demonstrating that our method significantly reduces circuit compilation time compared to the conventional approach, resulting in a substantial speedup in total runtime.

Frontiers of PhysicsVol. 21(8)
National Supercomputer Centre in Guangzhou, Basic and Applied Basic Research Foundation of Guangdong Province
Decent work and economic growth
Openalex Percentile: Top 95%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Using a single circuit to compute the gradients with respect to all parameters of a quantum neural network — Guang Ping He · Frontiers of Physics (2026) | TGRS Research Map | TGRS