Quantum Circuit Optimization Techniques Using Iterative Pre-Conditioned Gradient Descent

This paper introduces new optimization techniques which are optimizing QFT(Qunatum Fourier Transformation) circuit, Momentum-Based Iterative Pre-Conditioned Gradient Descent and Nesterov Accelerated Momentum IPCGD to obtain faster and closer approximations in complex problems of optimization. Traditional algorithms, such as normal Gradient Descent, Adam, normal IPCGD (Iteratively Pre-Conditioned Gradient Descent), often suffer from slow progress, oscillations about the solution, and challenges in dealing with noise, especially in complicated or unstable regimes. These proposed techniques use momentum to smooth the updates and predict future steps to arrive at the desired solution in as many as 50 percent fewer iterations compared to standard methods. Experimentation has shown these methods to be outstanding for tasks like quantum circuit optimization with faster convergence and better accuracy. This research addresses some of the key challenges in optimization, improving both efficiency and stability, making it suitable for using in noisy and dynamic settings.

Authors

Institutions

Publication Details

Published
2024-12-20
DOI
https://doi.org/10.1109/ised63599.2024.10957260
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum Circuit Optimization Techniques Using Iterative Pre-Conditioned Gradient Descent

Shyamapada Mukherjee, Suvankar Tudu
Quantum Computing Algorithms and Architecture
article

Quantum Circuit Optimization Techniques Using Iterative Pre-Conditioned Gradient Descent

Shyamapada Mukherjee, Suvankar Tudu
article en

Abstract

This paper introduces new optimization techniques which are optimizing QFT(Qunatum Fourier Transformation) circuit, Momentum-Based Iterative Pre-Conditioned Gradient Descent and Nesterov Accelerated Momentum IPCGD to obtain faster and closer approximations in complex problems of optimization. Traditional algorithms, such as normal Gradient Descent, Adam, normal IPCGD (Iteratively Pre-Conditioned Gradient Descent), often suffer from slow progress, oscillations about the solution, and challenges in dealing with noise, especially in complicated or unstable regimes. These proposed techniques use momentum to smooth the updates and predict future steps to arrive at the desired solution in as many as 50 percent fewer iterations compared to standard methods. Experimentation has shown these methods to be outstanding for tasks like quantum circuit optimization with faster convergence and better accuracy. This research addresses some of the key challenges in optimization, improving both efficiency and stability, making it suitable for using in noisy and dynamic settings.

National Institute of Technology Rourkela (IN)
Climate action
Openalex Percentile: Top 73%
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.

Quantum Circuit Optimization Techniques Using Iterative Pre-Conditioned Gradient Descent — Shyamapada Mukherjee, Suvankar Tudu · (2024) | TGRS Research Map | TGRS