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

Environment-assisted shortcuts to adiabaticity

Deffner, Sebastian

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•9 citations

Dark states of atomic ensembles

Yuri Ozhigov

•Jan 1, 2016•0 citations

Strong Decay of Correlations for Gibbs States in Any Dimension

Capel Cuevas, Angela, Andreas Blühm, Pérez-Hernández, Antonio

Acknowledgements: AB acknowledges financial support from the European Research Council (ERC Grant Agreement No. 81876) and VILLUM FONDEN via the QMATH Centre of Excellence (Grant No.10059). Moreover, AB is supported by the French National Research Agency in the framework of the “France 2030” program (ANR-11-LABX-0025-01) for the LabEx PERSYVAL. AC acknowledges the support of the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – Project-ID 470903074 – TRR 352. APH is partially supported by the Escuela Técnica Superior de Ingenieros Industriales (UNED) of Spain, project 2023-ETSII-UNED-01, as well as by the Spanish Ministerio de Ciencia e Innovación project PID2020-113523GB-I00 and by Comunidad de Madrid project QUITEMAD-CM P2018/TCS4342. AC and AB are grateful for the hospitality of Perimeter Institute where part of this work was carried out. Research at Perimeter Institute is supported in part by the Government of Canada through the Department of Innovation, Science and Economic Development and by the Province of Ontario through the Ministry of Colleges and Universities. This research was also supported in part by the Simons Foundation through the Simons Foundation Emmy Noether Fellows Program at Perimeter Institute.

•Jul 26, 2024•0 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

The Quantum Impurity Problem

Maxime Debertolis

Springer theses•Jan 1, 2024•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
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
Acknowledgements: AB acknowledges financial support from the European Research Council (ERC Grant Agreement No. 81876) and VILLUM FONDEN via the QMATH Centre of Excellence (Grant No.10059). Moreover, AB is supported by the French National Research Agency in the framework of the “France 2030” program (ANR-11-LABX-0025-01) for the LabEx PERSYVAL. AC acknowledges the support of the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – Project-ID 470903074 – TRR 352. APH is partially supported by the Escuela Técnica Superior de Ingenieros Industriales (UNED) of Spain, project 2023-ETSII-UNED-01, as well as by the Spanish Ministerio de Ciencia e Innovación project PID2020-113523GB-I00 and by Comunidad de Madrid project QUITEMAD-CM P2018/TCS4342. AC and AB are grateful for the hospitality of Perimeter Institute where part of this work was carried out. Research at Perimeter Institute is supported in part by the Government of Canada through the Department of Innovation, Science and Economic Development and by the Province of Ontario through the Ministry of Colleges and Universities. This research was also supported in part by the Simons Foundation through the Simons Foundation Emmy Noether Fellows Program at Perimeter Institute.
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/ .