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

Theoretical and mathematical physics

Quantum Algorithm III

Masanori Ohya, Igor Vasil'evich Volovich

Published Jan 1, 2011• 1 citation
Publisher
DOI
10.1007/978-94-007-0171-7_14

Related papers

Quantum Algorithms II

Masanori Ohya, Igor Vasil'evich Volovich

Theoretical and mathematical physics•Jan 1, 2011•0 citations

Construction of Flexible Type II and III QC-LDPC Codes

Gabofetswe Malema

Type II and III low-density parity-check codes (QC-LDPC) codes have been shown to have better minimum distance compared to Type I QC-LDPC codes. This article presents a highly flexible method for constructing high-girth type II and III QC-LDPC codes. The proposed algorithm establishes constraints to be observed in creating a bipartite graph of a given girth. The algorithm is by far more flexible in constructing a wide range (rates and lengths) of type II and III QC-LDPC codes compared to existing methods. Although the proposed algorithm uses a search approach to construct codes, it generally successfully constructs a code even at low code lengths. Constructed codes show better bit error rate performances compared to type I codes as expected.

Science Journal of Circuits Systems and Signal Processing•Jan 1, 2014•1 citation

Quantum Algorithms I

Masanori Ohya, Igor Vasil'evich Volovich

Theoretical and mathematical physics•Jan 1, 2011•0 citations

Improved quantum attack on several generalized unbalanced Feistel structures

Kun Zou, Xinfeng Dong, Zhang Fuzhong

By studying the attack technology based on Simon, Grover and other quantum algorithms for the security of block cipher structure, this paper proposes new quantum attack on 6 generalized unbalanced Feistel structures. We improve the attack results of n-cell structure, New Structure I/III/IV structure and FBC-like structure, and give a quantum attack on Skipjack structure for the first time. Based on Simon algorithm, this paper constructs a n2-round, a 12/12/6-round and a 4-round quantum distinguisher about n-cell structure, New structure I/III/IV and FBC-like structure, improving n2-n-1 rounds, 6 rounds/3 rounds/1 round and 1 round separately, comparing to the previous results. In addition, this paper also constructs a 9-round quantum distinguisher about Skipjack structure. Moreover, this paper proposes a quantum key recovery attack on the above six structures in combination with Grover algorithm, and the time complexities of attacks are analyzed.

International Conference on Networks, Communications and Information Technology (CNCIT)•Jun 1, 2022•7 citations

Quantum Algorithm

WORLD SCIENTIFIC eBooks•Jul 9, 2024•0 citations

Thermonuclear Fusion Based Quantum-Inspired Algorithm for Solving Multiobjective Optimization Problems

Liliya Anatolievna Demidova, Владимир Владимирович Масленников

This paper introduces a novel quantum-inspired algorithm for numerical multiobjective optimization, uniquely integrating the multilevel structure of qudits with principles of controlled thermonuclear fusion. Moving beyond conventional qubit-based approaches, the algorithm leverages the qudit’s higher-dimensional state space to enhance search capabilities. Fusion-inspired dynamics—modeling particle interaction, energy release, and plasma cooling—provide a powerful metaheuristic framework for navigating complex, high-dimensional Pareto fronts. A hybrid quantum-classical version of the algorithm is presented, designed to exploit the complementary strengths of both computational paradigms for improved efficiency in solving dynamic multiobjective problems. Experimental evaluation on standard dynamic multiobjective benchmarks demonstrates clear performance advantages. Both the quantum-inspired and hybrid variants consistently outperform leading classical algorithms such as NSGA-III, MOEA/D and GDE3, as well as the quantum-inspired NSGA-III, in key metrics: identifying a greater number of unique non-dominated solutions, ensuring superior uniformity along the Pareto front, maintaining stable convergence across generations, and achieving higher accuracy in approximating the ideal solution.

Algorithms•Dec 15, 2025•0 citations
Type II and III low-density parity-check codes (QC-LDPC) codes have been shown to have better minimum distance compared to Type I QC-LDPC codes. This article presents a highly flexible method for constructing high-girth type II and III QC-LDPC codes. The proposed algorithm establishes constraints to be observed in creating a bipartite graph of a given girth. The algorithm is by far more flexible in constructing a wide range (rates and lengths) of type II and III QC-LDPC codes compared to existing methods. Although the proposed algorithm uses a search approach to construct codes, it generally successfully constructs a code even at low code lengths. Constructed codes show better bit error rate performances compared to type I codes as expected.
By studying the attack technology based on Simon, Grover and other quantum algorithms for the security of block cipher structure, this paper proposes new quantum attack on 6 generalized unbalanced Feistel structures. We improve the attack results of n-cell structure, New Structure I/III/IV structure and FBC-like structure, and give a quantum attack on Skipjack structure for the first time. Based on Simon algorithm, this paper constructs a n2-round, a 12/12/6-round and a 4-round quantum distinguisher about n-cell structure, New structure I/III/IV and FBC-like structure, improving n2-n-1 rounds, 6 rounds/3 rounds/1 round and 1 round separately, comparing to the previous results. In addition, this paper also constructs a 9-round quantum distinguisher about Skipjack structure. Moreover, this paper proposes a quantum key recovery attack on the above six structures in combination with Grover algorithm, and the time complexities of attacks are analyzed.
This paper introduces a novel quantum-inspired algorithm for numerical multiobjective optimization, uniquely integrating the multilevel structure of qudits with principles of controlled thermonuclear fusion. Moving beyond conventional qubit-based approaches, the algorithm leverages the qudit’s higher-dimensional state space to enhance search capabilities. Fusion-inspired dynamics—modeling particle interaction, energy release, and plasma cooling—provide a powerful metaheuristic framework for navigating complex, high-dimensional Pareto fronts. A hybrid quantum-classical version of the algorithm is presented, designed to exploit the complementary strengths of both computational paradigms for improved efficiency in solving dynamic multiobjective problems. Experimental evaluation on standard dynamic multiobjective benchmarks demonstrates clear performance advantages. Both the quantum-inspired and hybrid variants consistently outperform leading classical algorithms such as NSGA-III, MOEA/D and GDE3, as well as the quantum-inspired NSGA-III, in key metrics: identifying a greater number of unique non-dominated solutions, ensuring superior uniformity along the Pareto front, maintaining stable convergence across generations, and achieving higher accuracy in approximating the ideal solution.