Efficient Parameter-Shift Rule Implementation for Computing Gradient on Quantum Simulators

Quantum computing is an active research interest in the new computational area with various applications. In the quantum machine learning field, the parameterized quantum circuit is a core learnable model; this model is updated iteratively by the general Parameter-Shift Rule (PSR) technique. In many qubits and parameter scenarios, using PSR consumes significant computational resources, particularly in the quantum simulator. Therefore, this research proposes a method to perform the PSR more efficiently for matrix multiplication and state-based real-world quantum simulators. The results show that our method is faster than baseline matrix multiplication-based 12 times and baseline state-based 39 times on average experiment.

Authors

Institutions

Publication Details

Published
2024-10-17
DOI
https://doi.org/10.1109/atc63255.2024.10908246
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.35

Funders

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

Efficient Parameter-Shift Rule Implementation for Computing Gradient on Quantum Simulators

Vu Tuan Hai, Yasuhiko Nakashima, Pham Hoai Luan, Vu Trung Duong Le
1 citations
Quantum Computing Algorithms and Architecture
0.35
article

Efficient Parameter-Shift Rule Implementation for Computing Gradient on Quantum Simulators

Vu Tuan Hai, Yasuhiko Nakashima, Pham Hoai Luan, Vu Trung Duong Le
article en
1 citations

Abstract

Quantum computing is an active research interest in the new computational area with various applications. In the quantum machine learning field, the parameterized quantum circuit is a core learnable model; this model is updated iteratively by the general Parameter-Shift Rule (PSR) technique. In many qubits and parameter scenarios, using PSR consumes significant computational resources, particularly in the quantum simulator. Therefore, this research proposes a method to perform the PSR more efficiently for matrix multiplication and state-based real-world quantum simulators. The results show that our method is faster than baseline matrix multiplication-based 12 times and baseline state-based 39 times on average experiment.

Nara Institute of Science and Technology (JP)
Japan Society for the Promotion of Science
Openalex Percentile: Top 29%
Quantum Computing Algorithms and Architecture
0.35
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.