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

Toward Quantum-Level Computational Efficiency on Classical Computers- Weak-Gate-Inspired Algorithms, Fractal Operator Hierarchies, and Multiscale Optimization.

Mr.PAI and Mrs.Yoon A Limsuwan, PAI, Yoon A Limsuwan

Published Oct 25, 2026• 0 citations
Publisher
DOI
10.5281/zenodo.23628883

Related papers

Algorithms and computational complexity in quantum simulation and quantum machine learning

B. Jobst, Frank Pollmann, Technische Universität München

•Jan 1, 2026•0 citations

Quantum-Inspired Optimization via Fractal Geometry

Jincheng Zhang

Quantum-inspired optimization is a burgeoning field aiming to emulate the behavior of quantum algorithms to accelerate computationally intensive optimization problems. This paper explores the application of fractal geometry to enhance the efficiency of optimization techniques, proposing a novel approach that leverages fractal representations to create a more complex search space. We demonstrate the effectiveness of this method through the analysis of a challenging, non-convex optimization problem, showcasing significant improvements in convergence and solution quality compared to traditional methods. The core mechanism centers around the construction of a fractal search space, which, through the application of specific fractal operations, facilitates a more efficient exploration of the solution space. This investigation provides a foundational understanding of how fractal geometry can be effectively integrated into optimization to overcome limitations inherent in conventional approaches.

•Sep 1, 2026•0 citations

Classical Coding Approaches to Quantum Applications

Narayanan Rengaswamy

Quantum information science strives to leverage the quantum-mechanical nature of our universe in order to achieve large improvements in certain information processing tasks. In deep-space optical communications, current receivers for the pure-state classical-quantum channel first measure each qubit channel output and then classically post-process the measurements. This approach is sub-optimal. In this dissertation we investigate a recently proposed quantum algorithm for this task, which is inspired by classical belief-propagation algorithms, and analyze its performance on a simple $5$-bit code. We show that the algorithm is optimal for each bit and it appears to achieve optimal performance when deciding the full transmitted message. We also provide explicit circuits for the algorithm in terms of standard gates. This suggests a near-term quantum communication advantage over the aforementioned sub-optimal scheme. Quantum error correction is vital to building a universal fault-tolerant quantum computer. We propose an efficient algorithm that can translate a given logical Clifford operation on a stabilizer code into all (equivalence classes of) physical Clifford circuits that realize that operation. In order to achieve universality, one also needs to implement at least one non-Clifford logical operation. So, we develop a mathematical framework for a large subset of diagonal operations in the Clifford hierarchy, which we call Quadratic Form Diagonal (QFD) gates. Then we use the QFD formalism to characterize all stabilizer codes whose code spaces are preserved under the transversal action of the non-Clifford $T$ gates on the physical qubits. We also discuss a few purely-classical coding problems motivated by transversal $T$ gates. A conscious effort has been made to keep this dissertation self-contained, by including necessary background material on quantum information and computation.

arXiv:2004.06834•Apr 14, 2020•2 citations

High-Performance Fractal Quantum Algorithms for Computation and Cryptography

Stergios Pellis

•Jan 1, 2026•9 citations

Local Relaxation Hierarchies for Quantum Ground State Energies: Convergence Guarantees and Message Passing Algorithms

Sheng-Ku Lin, Ricardo Rivera Cardoso, Roberto Bondesan

Convex relaxation hierarchies provide lower bounds to the ground state energy of quantum many-body systems that can be computed in polynomial time on a classical computer, at any fixed hierarchy level. However, scaling these methods to large systems and accurate approximations remains challenging due to the computational cost of traditional solvers and the scarcity of efficiency guarantees. In this work, we develop local relaxation hierarchies and efficient, highly parallelisable message passing algorithms for estimating the relaxed ground state energies. We show that the first level of the hierarchy---based on local consistency of pairwise reduced density matrices---is exact for commuting Hamiltonians on trees. We further establish that another hierarchy, based on consistent intervals, converges exponentially fast in the interval size to the ground state energy for weak perturbations of separable Hamiltonians on a chain, thereby providing an efficient classical algorithm for these systems. Then, we introduce two variants of message passing algorithms that run in $\mathcal{O}(n/ε^2)$ and $\mathcal{O}(n/ε)$ time for any fixed level of the local hierarchy on bounded-degree graphs, where $ε$ is the precision for the relaxed ground state energy per site. This assumes that the optimal messages have $\mathcal{O}(1)$ norm---a condition we observe in practical settings in our experiments. These algorithms are based on the subgradient method and the Nesterov-type accelerated gradient descent method applied to an entropy-smoothed objective. Finally, we benchmark the message passing algorithms across different quantum Hamiltonians, lattice geometries, and relaxation levels, validating the theoretical predictions and their potential to surpass standard convex optimisation solvers for this problem. We release the resulting library at github.com/rick1924/gse-message-passing.

quant-pharXiv:2609.40336•Oct 1, 2026•0 citations

Quantum algorithms, quantum field theory, and computational complexity

Keith S. M. Lee

Bulletin of the American Physical Society•Mar 3, 2015•0 citations
Quantum-inspired optimization is a burgeoning field aiming to emulate the behavior of quantum algorithms to accelerate computationally intensive optimization problems. This paper explores the application of fractal geometry to enhance the efficiency of optimization techniques, proposing a novel approach that leverages fractal representations to create a more complex search space. We demonstrate the effectiveness of this method through the analysis of a challenging, non-convex optimization problem, showcasing significant improvements in convergence and solution quality compared to traditional methods. The core mechanism centers around the construction of a fractal search space, which, through the application of specific fractal operations, facilitates a more efficient exploration of the solution space. This investigation provides a foundational understanding of how fractal geometry can be effectively integrated into optimization to overcome limitations inherent in conventional approaches.
Quantum information science strives to leverage the quantum-mechanical nature of our universe in order to achieve large improvements in certain information processing tasks. In deep-space optical communications, current receivers for the pure-state classical-quantum channel first measure each qubit channel output and then classically post-process the measurements. This approach is sub-optimal. In this dissertation we investigate a recently proposed quantum algorithm for this task, which is inspired by classical belief-propagation algorithms, and analyze its performance on a simple 555-bit code. We show that the algorithm is optimal for each bit and it appears to achieve optimal performance when deciding the full transmitted message. We also provide explicit circuits for the algorithm in terms of standard gates. This suggests a near-term quantum communication advantage over the aforementioned sub-optimal scheme. Quantum error correction is vital to building a universal fault-tolerant quantum computer. We propose an efficient algorithm that can translate a given logical Clifford operation on a stabilizer code into all (equivalence classes of) physical Clifford circuits that realize that operation. In order to achieve universality, one also needs to implement at least one non-Clifford logical operation. So, we develop a mathematical framework for a large subset of diagonal operations in the Clifford hierarchy, which we call Quadratic Form Diagonal (QFD) gates. Then we use the QFD formalism to characterize all stabilizer codes whose code spaces are preserved under the transversal action of the non-Clifford TTT gates on the physical qubits. We also discuss a few purely-classical coding problems motivated by transversal TTT gates. A conscious effort has been made to keep this dissertation self-contained, by including necessary background material on quantum information and computation.
Convex relaxation hierarchies provide lower bounds to the ground state energy of quantum many-body systems that can be computed in polynomial time on a classical computer, at any fixed hierarchy level. However, scaling these methods to large systems and accurate approximations remains challenging due to the computational cost of traditional solvers and the scarcity of efficiency guarantees. In this work, we develop local relaxation hierarchies and efficient, highly parallelisable message passing algorithms for estimating the relaxed ground state energies. We show that the first level of the hierarchy---based on local consistency of pairwise reduced density matrices---is exact for commuting Hamiltonians on trees. We further establish that another hierarchy, based on consistent intervals, converges exponentially fast in the interval size to the ground state energy for weak perturbations of separable Hamiltonians on a chain, thereby providing an efficient classical algorithm for these systems. Then, we introduce two variants of message passing algorithms that run in O(n/ε2)\mathcal{O}(n/ε^2)O(n/ε2) and O(n/ε)\mathcal{O}(n/ε)O(n/ε) time for any fixed level of the local hierarchy on bounded-degree graphs, where εεε is the precision for the relaxed ground state energy per site. This assumes that the optimal messages have O(1)\mathcal{O}(1)O(1) norm---a condition we observe in practical settings in our experiments. These algorithms are based on the subgradient method and the Nesterov-type accelerated gradient descent method applied to an entropy-smoothed objective. Finally, we benchmark the message passing algorithms across different quantum Hamiltonians, lattice geometries, and relaxation levels, validating the theoretical predictions and their potential to surpass standard convex optimisation solvers for this problem. We release the resulting library at github.com/rick1924/gse-message-passing.