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

IEEE International Symposium on Circuits and Systems proceedings

Additive Resource Scaling in Quantum Circuits for Search in Cryptanalysis

Leonardo Lavagna, Giacomo Vittori, Antonello Rosato, Massimo Panella

Published May 24, 2026• 0 citations
Publisher

Abstract

Quantum search algorithms are often analyzed in idealized, isolated models, yet real hardware and cryptanalytic applications involve communication channels and residual entanglement. We develop a unified circuit framework that models these effects explicitly, introducing a controllable quantum-channel interaction between system and environment registers. The resulting non-isolated circuits exhibit additive time-space behavior, instead of standard multiplicative scaling. We provide circuit schematics, simulation data, and performance visualization demonstrating how a single-qubit environment modifies Grover oscillations and success probability trajectories of cryptographic attacks. The proposed framework connects algorithmic tradeoffs with measurable circuit phenomena, offering a practical methodology for quantum-classical hybrid circuits design.

DOI
10.1109/iscas66217.2026.11562218

Related papers

Enhancing Classical and Quantum Algorithms through Circuit Optimization and Hybrid Visualization Framework

Akshat Verma, Raj Basnet, Bina Kotiyal +2 more

This paper presents a hybrid computational framework that integrates classical and quantum optimization techniques to improve the efficiency of Huffman encoding and string-matching algorithms.On the classical side, performance is enhanced through SIMD (Single Instruction, Multiple Data) parallelism, bitlevel operations, and cache-aware data structures.On the quantum side, we investigate Grover-based string search using amplitude amplification, approximate reflection operators, and entropy-aware circuit design tailored for Noisy Intermediate-Scale Quantum (NISQ) constraints.The primary contribution of this work is a hybrid visualization framework that synchronizes classical algorithmic flowcharts with real-time quantum circuit representations, enabling unified debugging, execution tracing, and performance analysis across both domains.Experimental evaluations conducted using optimized classical implementations and quantum simulators with noise models demonstrate up to a 65% reduction in runtime for quantum-enhanced string search and over a 30% speedup in classical SIMD-accelerated Huffman encoding.The proposed quantum optimizations maintain an accuracy above 97% while reducing circuit depth, indicating practical feasibility under current NISQ limitations.By improving both algorithmic performance and developer interpretability, this hybrid framework serves as an effective tool for algorithm design, analysis, and education.The results highlight the potential of tightly coupled classical-quantum workflows and motivate further research into scalable, NISQ-compatible hybrid algorithm development.

Advances in intelligent systems research/Advances in Intelligent Systems Research•Jan 1, 2026•0 citations

A Unified Quantum Circuit Framework for Grover Search and Quantum Walks in NISQ Cryptanalysis

Leonardo Lavagna, Giacomo Vittori, Antonello Rosato +1 more

This paper explores the use of quantum search in symmetric cryptanalysis within the Noisy Intermediate-Scale Quantum (NISQ) regime, introducing a unified quantum circuit framework that expresses Grover’s algorithm as a coined quantum walk. This enables a direct comparison of the two approaches, previously treated separately, under a common model of circuital resources and noise. The framework is implemented and tested on cyclic permutations and AES-like primitives. Experiments show that, in the ideal case, the walk exhibits the familiar Grover amplification curve although, under realistic depolarizing and readout noise, the peaks are damped and the optimal number of steps falls below the theoretical value. In the AES examples, the probability of recovering the key remains negligible. Taken together, these results extend earlier analyses and suggest that symmetric encryption maintains classical-level security in the NISQ era of quantum circuits, while also providing a reproducible testbed for future studies.

IEEE International Symposium on Circuits and Systems proceedings•May 24, 2026•0 citations

Quantum Algorithm Design Paradigms: A Unified Theory of Hybrid Enhancement Strategies

Poojitha Appaneni

We present a unified theoretical framework that classifies and analyzes quantum enhancement strategies for classical algorithms, establishing design paradigms that systematically combine quantum subroutines with classical procedures. The theory identifies four fundamental enhancement mechanisms: quantum search acceleration through amplitude amplification, quantum sampling for probabilistic optimization, quantum interference for solution space pruning, and quantum entanglement for correlation exploitation. We formalize each mechanism mathematically and derive general conditions under which they provide computational advantages, establishing a taxonomy of hybrid algorithm architectures. Our framework proves that quantum enhancement effectiveness depends critically on problem structure characteristics including solution density, constraint complexity, and objective function landscape topology. We establish theoretical bounds on achievable speedups for each enhancement paradigm and prove separation results showing that certain problem classes favor specific quantum integration strategies. The theory incorporates practical considerations including quantum circuit depth limitations, measurement overhead, and classical-quantum communication costs, providing realistic performance predictions. We extend the analysis to automated algorithm synthesis, deriving principles for selecting optimal quantum-classical decompositions given problem specifications and hardware constraints. This unified theoretical perspective advances quantum algorithm design from ad-hoc development to principled engineering, offering a comprehensive roadmap for creating hybrid quantum-classical algorithms across optimization, machine learning, simulation, and graph theory applications with provable performance characteristics.

•Nov 26, 2025•0 citations

Quantum resource estimation for large scale quantum algorithms

Vlad Gheorghiu, Michele Mosca

Quantum algorithms are often represented in terms of quantum circuits operating on ideal (logical) qubits. However, the practical implementation of these algorithms poses significant challenges. Many quantum algorithms require a substantial number of logical qubits, and the inherent susceptibility to errors of quantum computers require quantum error correction. The integration of error correction introduces overhead in terms of both space (physical qubits required) and runtime (how long the algorithm needs to be run for). This paper addresses the complexity of comparing classical and quantum algorithms, primarily stemming from the additional quantum error correction overhead. We propose a comprehensive framework that facilitates a direct and meaningful comparison between classical and quantum algorithms. By acknowledging and addressing the challenges introduced by quantum error correction, our framework aims to provide a clearer understanding of the comparative performance of classical and quantum computing approaches. This work contributes to understanding the practical viability and potential advantages of quantum algorithms in real-world applications. We apply our framework to quantum cryptanalysis, since it is well known that quantum algorithms can break factoring and discrete logarithm based cryptography and weaken symmetric cryptography and hash functions. In order to estimate the real-world impact of these attacks, apart from tracking the development of fault-tolerant quantum computers it is important to have an estimate of the resources needed to implement these quantum attacks. This analysis provides state-of-the art snap-shot estimates of the realistic costs of implementing quantum attacks on these important cryptographic algorithms, assuming quantum fault-tolerance is achieved using surface code methods, and spanning a range of potential error rates. These estimates serve as a guide for gauging the realistic impact of these algorithms and for benchmarking the impact of future advances in quantum algorithms, circuit synthesis and optimization, fault-tolerance methods and physical error rates.

Future Generation Computer Systems•Aug 12, 2024•25 citations

A framework for reducing the overhead of the quantum oracle for use with Grover’s algorithm with applications to cryptanalysis of SIKE

Jean‐François Biasse, Benjamin Pring

Abstract In this paper we provide a framework for applying classical search and preprocessing to quantum oracles for use with Grover’s quantum search algorithm in order to lower the quantum circuit-complexity of Grover’s algorithm for single-target search problems. This has the effect (for certain problems) of reducing a portion of the polynomial overhead contributed by the implementation cost of quantum oracles and can be used to provide either strict improvements or advantageous trade-offs in circuit-complexity. Our results indicate that it is possible for quantum oracles for certain single-target preimage search problems to reduce the quantum circuit-size from O 2 n / 2 ⋅ m C $O\left(2^{n/2}\cdot mC\right)$ (where C originates from the cost of implementing the quantum oracle) to O ( 2 n / 2 ⋅ m C ) $O(2^{n/2} \cdot m\sqrt{C})$ without the use of quantum ram, whilst also slightly reducing the number of required qubits. This framework captures a previous optimisation of Grover’s algorithm using preprocessing [21] applied to cryptanalysis, providing new asymptotic analysis. We additionally provide insights and asymptotic improvements on recent cryptanalysis [16] of SIKE [14] via Grover’s algorithm, demonstrating that the speedup applies to this attack and impacting upon quantum security estimates [16] incorporated into the SIKE specification [14].

Journal of Mathematical Cryptology•Nov 17, 2020•9 citations

A Modular Benchmark of Variational Quantum Attack Algorithms for S-DES

Zeguo Wang, Quanfeng Lu, Wentao Yang +3 more

Variational quantum algorithms (VQAs) have emerged as a promising approach to quantum cryptanalysis on noisy intermediate-scale quantum (NISQ) devices. Although numerous variational attack schemes have been proposed for symmetric cryptosystems, a systematic and modular benchmarking framework to evaluate their performance is still lacking. In this work, we present a comprehensive benchmark study of variational quantum attacks on the Simplified Data Encryption Standard (S-DES), focusing on the modular design choices that determine attack efficiency. We formulate variational quantum attacks within a unified framework consisting of four components: initial state preparation, parameterized circuit (Ansatz) design, cost function construction, and classical optimization. Through numerical simulations, we systematically compare representative design alternatives and evaluate their combinations in terms of convergence behavior, success probability, and effective time complexity. We further introduce standardized metrics for assessing variational quantum attack performance. Our results reveal clear performance hierarchies among different modular configurations and show that carefully optimized designs can significantly outperform naive quantum search. This work establishes a principled benchmark methodology for variational quantum cryptanalysis and positions S-DES as a practical testbed for evaluating quantum attacks on symmetric ciphers in the NISQ era.

quant-pharXiv:2606.30143•Jun 30, 2026•0 citations
Quantum search algorithms are often analyzed in idealized, isolated models, yet real hardware and cryptanalytic applications involve communication channels and residual entanglement. We develop a unified circuit framework that models these effects explicitly, introducing a controllable quantum-channel interaction between system and environment registers. The resulting non-isolated circuits exhibit additive time-space behavior, instead of standard multiplicative scaling. We provide circuit schematics, simulation data, and performance visualization demonstrating how a single-qubit environment modifies Grover oscillations and success probability trajectories of cryptographic attacks. The proposed framework connects algorithmic tradeoffs with measurable circuit phenomena, offering a practical methodology for quantum-classical hybrid circuits design.
This paper presents a hybrid computational framework that integrates classical and quantum optimization techniques to improve the efficiency of Huffman encoding and string-matching algorithms.On the classical side, performance is enhanced through SIMD (Single Instruction, Multiple Data) parallelism, bitlevel operations, and cache-aware data structures.On the quantum side, we investigate Grover-based string search using amplitude amplification, approximate reflection operators, and entropy-aware circuit design tailored for Noisy Intermediate-Scale Quantum (NISQ) constraints.The primary contribution of this work is a hybrid visualization framework that synchronizes classical algorithmic flowcharts with real-time quantum circuit representations, enabling unified debugging, execution tracing, and performance analysis across both domains.Experimental evaluations conducted using optimized classical implementations and quantum simulators with noise models demonstrate up to a 65% reduction in runtime for quantum-enhanced string search and over a 30% speedup in classical SIMD-accelerated Huffman encoding.The proposed quantum optimizations maintain an accuracy above 97% while reducing circuit depth, indicating practical feasibility under current NISQ limitations.By improving both algorithmic performance and developer interpretability, this hybrid framework serves as an effective tool for algorithm design, analysis, and education.The results highlight the potential of tightly coupled classical-quantum workflows and motivate further research into scalable, NISQ-compatible hybrid algorithm development.
This paper explores the use of quantum search in symmetric cryptanalysis within the Noisy Intermediate-Scale Quantum (NISQ) regime, introducing a unified quantum circuit framework that expresses Grover’s algorithm as a coined quantum walk. This enables a direct comparison of the two approaches, previously treated separately, under a common model of circuital resources and noise. The framework is implemented and tested on cyclic permutations and AES-like primitives. Experiments show that, in the ideal case, the walk exhibits the familiar Grover amplification curve although, under realistic depolarizing and readout noise, the peaks are damped and the optimal number of steps falls below the theoretical value. In the AES examples, the probability of recovering the key remains negligible. Taken together, these results extend earlier analyses and suggest that symmetric encryption maintains classical-level security in the NISQ era of quantum circuits, while also providing a reproducible testbed for future studies.
We present a unified theoretical framework that classifies and analyzes quantum enhancement strategies for classical algorithms, establishing design paradigms that systematically combine quantum subroutines with classical procedures. The theory identifies four fundamental enhancement mechanisms: quantum search acceleration through amplitude amplification, quantum sampling for probabilistic optimization, quantum interference for solution space pruning, and quantum entanglement for correlation exploitation. We formalize each mechanism mathematically and derive general conditions under which they provide computational advantages, establishing a taxonomy of hybrid algorithm architectures. Our framework proves that quantum enhancement effectiveness depends critically on problem structure characteristics including solution density, constraint complexity, and objective function landscape topology. We establish theoretical bounds on achievable speedups for each enhancement paradigm and prove separation results showing that certain problem classes favor specific quantum integration strategies. The theory incorporates practical considerations including quantum circuit depth limitations, measurement overhead, and classical-quantum communication costs, providing realistic performance predictions. We extend the analysis to automated algorithm synthesis, deriving principles for selecting optimal quantum-classical decompositions given problem specifications and hardware constraints. This unified theoretical perspective advances quantum algorithm design from ad-hoc development to principled engineering, offering a comprehensive roadmap for creating hybrid quantum-classical algorithms across optimization, machine learning, simulation, and graph theory applications with provable performance characteristics.
Quantum algorithms are often represented in terms of quantum circuits operating on ideal (logical) qubits. However, the practical implementation of these algorithms poses significant challenges. Many quantum algorithms require a substantial number of logical qubits, and the inherent susceptibility to errors of quantum computers require quantum error correction. The integration of error correction introduces overhead in terms of both space (physical qubits required) and runtime (how long the algorithm needs to be run for). This paper addresses the complexity of comparing classical and quantum algorithms, primarily stemming from the additional quantum error correction overhead. We propose a comprehensive framework that facilitates a direct and meaningful comparison between classical and quantum algorithms. By acknowledging and addressing the challenges introduced by quantum error correction, our framework aims to provide a clearer understanding of the comparative performance of classical and quantum computing approaches. This work contributes to understanding the practical viability and potential advantages of quantum algorithms in real-world applications. We apply our framework to quantum cryptanalysis, since it is well known that quantum algorithms can break factoring and discrete logarithm based cryptography and weaken symmetric cryptography and hash functions. In order to estimate the real-world impact of these attacks, apart from tracking the development of fault-tolerant quantum computers it is important to have an estimate of the resources needed to implement these quantum attacks. This analysis provides state-of-the art snap-shot estimates of the realistic costs of implementing quantum attacks on these important cryptographic algorithms, assuming quantum fault-tolerance is achieved using surface code methods, and spanning a range of potential error rates. These estimates serve as a guide for gauging the realistic impact of these algorithms and for benchmarking the impact of future advances in quantum algorithms, circuit synthesis and optimization, fault-tolerance methods and physical error rates.
Abstract In this paper we provide a framework for applying classical search and preprocessing to quantum oracles for use with Grover’s quantum search algorithm in order to lower the quantum circuit-complexity of Grover’s algorithm for single-target search problems. This has the effect (for certain problems) of reducing a portion of the polynomial overhead contributed by the implementation cost of quantum oracles and can be used to provide either strict improvements or advantageous trade-offs in circuit-complexity. Our results indicate that it is possible for quantum oracles for certain single-target preimage search problems to reduce the quantum circuit-size from O 2 n / 2 ⋅ m C O(2n/2⋅mC)O\left(2^{n/2}\cdot mC\right)O(2n/2⋅mC) (where C originates from the cost of implementing the quantum oracle) to O ( 2 n / 2 ⋅ m C ) O(2n/2⋅mC)O(2^{n/2} \cdot m\sqrt{C})O(2n/2⋅mC​) without the use of quantum ram, whilst also slightly reducing the number of required qubits. This framework captures a previous optimisation of Grover’s algorithm using preprocessing [21] applied to cryptanalysis, providing new asymptotic analysis. We additionally provide insights and asymptotic improvements on recent cryptanalysis [16] of SIKE [14] via Grover’s algorithm, demonstrating that the speedup applies to this attack and impacting upon quantum security estimates [16] incorporated into the SIKE specification [14].
Variational quantum algorithms (VQAs) have emerged as a promising approach to quantum cryptanalysis on noisy intermediate-scale quantum (NISQ) devices. Although numerous variational attack schemes have been proposed for symmetric cryptosystems, a systematic and modular benchmarking framework to evaluate their performance is still lacking. In this work, we present a comprehensive benchmark study of variational quantum attacks on the Simplified Data Encryption Standard (S-DES), focusing on the modular design choices that determine attack efficiency. We formulate variational quantum attacks within a unified framework consisting of four components: initial state preparation, parameterized circuit (Ansatz) design, cost function construction, and classical optimization. Through numerical simulations, we systematically compare representative design alternatives and evaluate their combinations in terms of convergence behavior, success probability, and effective time complexity. We further introduce standardized metrics for assessing variational quantum attack performance. Our results reveal clear performance hierarchies among different modular configurations and show that carefully optimized designs can significantly outperform naive quantum search. This work establishes a principled benchmark methodology for variational quantum cryptanalysis and positions S-DES as a practical testbed for evaluating quantum attacks on symmetric ciphers in the NISQ era.