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

Quantum Machine Intelligence

Quantum-accelerated security analysis in quantum cryptography: semidefinite programming (SDP) from classical bottlenecks to quantum solutions — a comprehensive review

Abraham Itzhak Weinberg

Published Aug 10, 2026• 0 citations
Publisher
DOI
10.1007/s42484-026-00427-z

Related papers

Post-Quantum Cryptography: A Solution to Quantum Computing on Security Approaches

Purvi Tandel, Jitendra Nasriwala

Lecture notes in networks and systems•Jan 1, 2022•5 citations

Quantum Alternating Direction Method of Multipliers for Semidefinite Programming

Hantao Nie, Dong Un An, Zaiwen Wen

Semidefinite programming (SDP) is a fundamental convex optimization problem with wide-ranging applications. However, solving large-scale instances remains computationally challenging due to the high cost of solving linear systems and performing eigenvalue decompositions. In this paper, we present a quantum alternating direction method of multipliers (QADMM) for SDPs, building on recent advances in quantum computing. An inexact ADMM framework is developed, which tolerates errors in the iterates arising from block-encoding approximation and quantum measurement. Within this robust scheme, we design a polynomial proximal operator to address the semidefinite conic constraints and apply the quantum singular value transformation to accelerate the most costly projection updates. We prove that the scheme converges to an ϵ -optimal solution of the SDP problem under the strong duality assumption. A detailed complexity analysis shows that the QADMM algorithm achieves favorable scaling with respect to dimension compared to the classical ADMM algorithm and quantum interior point methods, highlighting its potential for solving large-scale SDPs.

arXiv:2510.10056•Quantum•Jul 8, 2026•2 citations

Semidefinite programming relaxations for quantum correlations

Armin Tavakoli, Alejandro Pozas-Kerstjens, Peter J. Brown +1 more

Sometimes a mathematical tool emerges as uniquely useful and even a defining feature within some branch of physics such as Feynman diagrams. In quantum information theory, the semidefinite program (SDP) has emerged as such a tool. SDP is an optimization task in which a linear objective function is maximized over a set of Hermitian matrices with positive eigenvalues. This review discusses the highly efficient algorithms available for the SDP, and shows how comprehensively the SDP has been deployed in problems of entanglement characterization, quantum nonlocality, quantum channel capacities, and the bounding of ground-state energies.

arXiv:2307.02551•Reviews of Modern Physics•Dec 4, 2024•106 citations

Post-Quantum Cryptography: Mathematical Foundations of Secure Communication in the Quantum Computing Era

Ilhan Arda Al

Human computer interaction.•Oct 2, 2026•0 citations

Semidefinite Programs for Randomness Extractors

Mario Berta, Omar Fawzi, Volkher B. Scholz

Randomness extractors are an important building block for classical and quantum cryptography. However, for many applications it is crucial that the extractors are quantum-proof, i.e., that they work even in the presence of quantum adversaries. In general, quantum-proof extractors are poorly understood and we would like to argue that in the same way as Bell inequalities (multiprover games) and communication complexity, the setting of randomness extractors provides a operationally useful framework for studying the power and limitations of a quantum memory compared to a classical one. We start by recalling how to phrase the extractor property as a quadratic program with linear constraints. We then construct a semidefinite programming (SDP) relaxation for this program that is tight for some extractor constructions. Moreover, we show that this SDP relaxation is even sufficient to certify quantum-proof extractors. This gives a unifying approach to understand the stability properties of extractors against quantum adversaries. Finally, we analyze the limitations of this SDP relaxation.

Leibniz international proceedings in informatics•Jan 1, 2015•3 citations

Post-Quantum Cryptography: A Systematic Review of Algorithms, Standardization, Challenges, and Future Research Directions

Aritrik Ghosh

•Jan 1, 2026•0 citations
Semidefinite programming (SDP) is a fundamental convex optimization problem with wide-ranging applications. However, solving large-scale instances remains computationally challenging due to the high cost of solving linear systems and performing eigenvalue decompositions. In this paper, we present a quantum alternating direction method of multipliers (QADMM) for SDPs, building on recent advances in quantum computing. An inexact ADMM framework is developed, which tolerates errors in the iterates arising from block-encoding approximation and quantum measurement. Within this robust scheme, we design a polynomial proximal operator to address the semidefinite conic constraints and apply the quantum singular value transformation to accelerate the most costly projection updates. We prove that the scheme converges to an ϵ -optimal solution of the SDP problem under the strong duality assumption. A detailed complexity analysis shows that the QADMM algorithm achieves favorable scaling with respect to dimension compared to the classical ADMM algorithm and quantum interior point methods, highlighting its potential for solving large-scale SDPs.
Sometimes a mathematical tool emerges as uniquely useful and even a defining feature within some branch of physics such as Feynman diagrams. In quantum information theory, the semidefinite program (SDP) has emerged as such a tool. SDP is an optimization task in which a linear objective function is maximized over a set of Hermitian matrices with positive eigenvalues. This review discusses the highly efficient algorithms available for the SDP, and shows how comprehensively the SDP has been deployed in problems of entanglement characterization, quantum nonlocality, quantum channel capacities, and the bounding of ground-state energies.
Randomness extractors are an important building block for classical and quantum cryptography. However, for many applications it is crucial that the extractors are quantum-proof, i.e., that they work even in the presence of quantum adversaries. In general, quantum-proof extractors are poorly understood and we would like to argue that in the same way as Bell inequalities (multiprover games) and communication complexity, the setting of randomness extractors provides a operationally useful framework for studying the power and limitations of a quantum memory compared to a classical one. We start by recalling how to phrase the extractor property as a quadratic program with linear constraints. We then construct a semidefinite programming (SDP) relaxation for this program that is tight for some extractor constructions. Moreover, we show that this SDP relaxation is even sufficient to certify quantum-proof extractors. This gives a unifying approach to understand the stability properties of extractors against quantum adversaries. Finally, we analyze the limitations of this SDP relaxation.