A comprehensive study of quantum arithmetic circuits
In recent decades, the field of quantum computing has experienced remarkable progress.
This progress is marked by the superior performance of many quantum algorithms …
This progress is marked by the superior performance of many quantum algorithms …
Quantum computing through the lens of control: A tutorial introduction
Quantum computing is a fascinating interdisciplinary research field that promises to
revolutionize computing by efficiently solving previously intractable problems. Recent years …
revolutionize computing by efficiently solving previously intractable problems. Recent years …
Modeling the performance of early fault-tolerant quantum algorithms
Progress in fault-tolerant quantum computation (FTQC) has driven the pursuit of practical
applications with early fault-tolerant quantum computers (EFTQC). These devices, limited in …
applications with early fault-tolerant quantum computers (EFTQC). These devices, limited in …
Halving the cost of quantum algorithms with randomization
Quantum signal processing (QSP) provides a systematic framework for implementing a
polynomial transformation of a linear operator, and unifies nearly all known quantum …
polynomial transformation of a linear operator, and unifies nearly all known quantum …
Quantum linear system solvers: A survey of algorithms and applications
Solving linear systems of equations plays a fundamental role in numerous computational
problems from different fields of science. The widespread use of numerical methods to solve …
problems from different fields of science. The widespread use of numerical methods to solve …
Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method
Quantum phase estimation is one of the most powerful quantum primitives. This work
proposes a new approach for the problem of multiple eigenvalue estimation: Quantum …
proposes a new approach for the problem of multiple eigenvalue estimation: Quantum …
Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era
Quantum Approximate Optimization Algorithm (QAOA) is one of the most promising quantum
heuristics for combinatorial optimization. While QAOA has been shown to perform well on …
heuristics for combinatorial optimization. While QAOA has been shown to perform well on …
Option pricing under stochastic volatility on a quantum computer
We develop quantum algorithms for pricing Asian and barrier options under the Heston
model, a popular stochastic volatility model, and estimate their costs, in terms of T-count, T …
model, a popular stochastic volatility model, and estimate their costs, in terms of T-count, T …
Assessment of quantum phase estimation protocols for early fault-tolerant quantum computers
We compare several quantum phase estimation (QPE) protocols intended for early fault-
tolerant (EFT) quantum computers in the context of models of their implementations on a …
tolerant (EFT) quantum computers in the context of models of their implementations on a …
Majority Voting with Recursive QAOA and Cost-restricted Uniform Sampling for Maximum-Likelihood Detection in Massive MIMO
B Gulbahar - IEEE Transactions on Wireless Communications, 2025 - ieeexplore.ieee.org
Quantum approximate optimization algorithm (QAOA) with layer depth p is promising near-
optimum performance and low complexity for NP-hard maximum-likelihood (ML) detection in …
optimum performance and low complexity for NP-hard maximum-likelihood (ML) detection in …