Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

InTech eBooks

Beating Difraction Limit using Dark States

Hebin Li, Yuri V. Rostovtsev

Published Apr 1, 2010• 0 citations
Publisher

Abstract

We gratefully acknowledge the support of the Office of Naval Research, the Robert A. Welch Foundation (Grants # A1261 and A1547), and the CRDF (Award No. AZP-3123-BA08 of Azerbaijan National Science Foundation).
DOI
10.5772/8651

Related papers

Dark states of atomic ensembles

Yuri Ozhigov

•Jan 1, 2016•0 citations

Environment-assisted shortcuts to adiabaticity

Sebastian Deffner

Agradecimentos: S.D. acknowledges support from the U.S. National Science Foundation under Grant No. DMR-2010127. This research was supported by grant number FQXi-RFP-1808 from the Foundational Questions Institute and Fetzer Franklin Fund, a donor advised fund of Silicon Valley Community Foundation (SD). We would like to thank Wojciech H. Zurek for many years of mentorship and his unwavering patience and willingness to teach us how to think about the mysteries of the quantum universe. Enlightening discussions with Agniva Roychowdhury are gratefully acknowledged

•Jan 1, 2021•7 citations

IEE Colloquium on Quantum Computing: Theory, Applications and Implications (Digest No.1997/145)

Institution of Engineering and Technology eBooks•Jan 1, 1997•0 citations

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms

Yunsoo Ha, Sara Shashaani, Matt Menickelly

The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. We numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs. History: Accepted by Giacomo Nannicini, Area Editor for Quantum Computing and Operations Research. Accepted for Special Issue. Funding: This material is based upon work supported by the U.S. Department of Energy, Office of Science, National Quantum Information Science Research Centers and the Office of Advanced Scientific Computing Research, Accelerated Research for Quantum Computing program under contract number DE-AC02-06CH11357. Y. Ha and S. Shashaani also gratefully acknowledge the U.S. National Science Foundation Division of Civil, Mechanical and Manufacturing Innovation Grant CMMI-2226347 and the U.S. Office of Naval Research [Grant N000142412398]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0575 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0575 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

arXiv:2401.08912•INFORMS journal on computing•Nov 27, 2024•5 citations

The Quantum Impurity Problem

Maxime Debertolis

Springer theses•Jan 1, 2024•0 citations

Report on the Conference on the Foundations of Quantum Mechanics

Ohio) Xavier University (Cincinnati

Report on the Conference on the Foundations of Quantum Mechanics, held at Xavier University in Cincinnati, Ohio, October 1-6, 1962. Boris Podolsky was Chairman, John Hart served as Conference Manager, and Frederick G. Werner was Assistant Chairman. The conference was sponsored jointly by the National Aeronautics and Space Administration, the Office of Naval Research, and the Judge Robert S. Marx Foundation. The report was submitted on July 15, 1963 and outlined the major activities of the conference.

•Jul 15, 1963•0 citations
Agradecimentos: S.D. acknowledges support from the U.S. National Science Foundation under Grant No. DMR-2010127. This research was supported by grant number FQXi-RFP-1808 from the Foundational Questions Institute and Fetzer Franklin Fund, a donor advised fund of Silicon Valley Community Foundation (SD). We would like to thank Wojciech H. Zurek for many years of mentorship and his unwavering patience and willingness to teach us how to think about the mysteries of the quantum universe. Enlightening discussions with Agniva Roychowdhury are gratefully acknowledged
The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. We numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs. History: Accepted by Giacomo Nannicini, Area Editor for Quantum Computing and Operations Research. Accepted for Special Issue. Funding: This material is based upon work supported by the U.S. Department of Energy, Office of Science, National Quantum Information Science Research Centers and the Office of Advanced Scientific Computing Research, Accelerated Research for Quantum Computing program under contract number DE-AC02-06CH11357. Y. Ha and S. Shashaani also gratefully acknowledge the U.S. National Science Foundation Division of Civil, Mechanical and Manufacturing Innovation Grant CMMI-2226347 and the U.S. Office of Naval Research [Grant N000142412398]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0575 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0575 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
Report on the Conference on the Foundations of Quantum Mechanics, held at Xavier University in Cincinnati, Ohio, October 1-6, 1962. Boris Podolsky was Chairman, John Hart served as Conference Manager, and Frederick G. Werner was Assistant Chairman. The conference was sponsored jointly by the National Aeronautics and Space Administration, the Office of Naval Research, and the Judge Robert S. Marx Foundation. The report was submitted on July 15, 1963 and outlined the major activities of the conference.