Tradeoff between noise and banding in a quantum adder with qudits

Quantum addition based on the quantum Fourier transform can be an integral part of a quantum circuit and proved to be more efficient than the existing classical ripple carry adder. Our study includes identifying the quantum resource required in a quantum adder in any arbitrary dimension and its relationship with the performance indicator in the presence of local noise acting on the circuit and when a limited number of controlled rotation operations is permitted, a procedure known as banding. We analytically prove an upper bound on the number of the controlled rotation gates required to accomplish the quantum addition up to an arbitrary defect in the fidelity between the desired and imperfect output. When the environment interacts with individual qudits, we establish a connection between quantum coherence and fidelity of the output. Interestingly, we demonstrate that when banding is employed in the presence of noise, approximate circuits of constant depth outperform circuits with a higher number of controlled rotations, establishing a complementary relationship between the approximate quantum adder and the strength of the noise. We exhibit that utilizing magnetic fields to prepare an initial state that evolves according to a one-dimensional spin chain for a specific amount of time can be a potential technique to implement quantum addition circuits in many-body systems.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2025-03-06
DOI
https://doi.org/10.1103/physreva.111.032408
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Tradeoff between noise and banding in a quantum adder with qudits

Gaurang Agrawal, Leela Ganesh Chandra Lakkaraju, Tanoy Kanti Konar, Aditi Sen
Physical review. A/Physical review, A
Quantum Information and Cryptography
article

Tradeoff between noise and banding in a quantum adder with qudits

Gaurang Agrawal, Leela Ganesh Chandra Lakkaraju, Tanoy Kanti Konar, Aditi Sen
article en

Abstract

Quantum addition based on the quantum Fourier transform can be an integral part of a quantum circuit and proved to be more efficient than the existing classical ripple carry adder. Our study includes identifying the quantum resource required in a quantum adder in any arbitrary dimension and its relationship with the performance indicator in the presence of local noise acting on the circuit and when a limited number of controlled rotation operations is permitted, a procedure known as banding. We analytically prove an upper bound on the number of the controlled rotation gates required to accomplish the quantum addition up to an arbitrary defect in the fidelity between the desired and imperfect output. When the environment interacts with individual qudits, we establish a connection between quantum coherence and fidelity of the output. Interestingly, we demonstrate that when banding is employed in the presence of noise, approximate circuits of constant depth outperform circuits with a higher number of controlled rotations, establishing a complementary relationship between the approximate quantum adder and the strength of the noise. We exhibit that utilizing magnetic fields to prepare an initial state that evolves according to a one-dimensional spin chain for a specific amount of time can be a potential technique to implement quantum addition circuits in many-body systems.

Physical review. A/Physical review, AVol. 111(3)
Harish-Chandra Research Institute (IN)
Openalex Percentile: Top 98%
Quantum Information and Cryptography
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.