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

Springer theses

Computational Techniques

Greg Lever

Published Jan 1, 2015• 1 citation
Publisher
DOI
10.1007/978-3-319-19351-9_3

Related papers

Numerical Techniques

Lecture notes in physics. M, Monographs•Jan 1, 1993•0 citations

Privacy-preserving computation meets quantum computing: A scoping review

Aitor Gómez-Goiri, Iñaki Seco-Aguirre, Óscar Lage +1 more

Privacy-Preserving Computation (PPC) comprises the techniques, schemes and protocols which ensure privacy and confidentiality in the context of secure computation and data analysis. Most of the current PPC techniques rely on the complexity of cryptographic operations, which are expected to be efficiently solved by quantum computers soon. This review explores how PPC can be built on top of quantum computing itself to alleviate these future threats. We analyze quantum proposals for Secure Multi-party Computation, Oblivious Transfer and Homomorphic Encryption from the last decade focusing on their maturity and the challenges they currently face. Our findings show a strong focus on purely theoretical works, but a rise on the experimental consideration of these techniques in the last 5 years. The applicability of these techniques to actual use cases is an underexplored aspect which could lead to the practical assessment of these techniques.

Digital Communications and Networks•May 21, 2025•4 citations

A Survey on Machine Learning Techniques Using Quantum Computing

T N Manjunath, Adarsh Hiremath, Mudligiriyappa Niranjanamurthy +3 more

Over the course of the last seven decades the world of computing has taken revolutionary reformations in the scope of classical computing. Classical computers manipulate ones and zeroes to crunch through operations given to them by users. An innovative strategy known as quantum computing leverages the concepts of quantum physics to solve issues that are too complex for conventional computers to handle. Two of the domains of science that are now progressing the fastest are theoretical machine learning and quantum computing theory. In recent years, researchers have begun examining how classic machine learning techniques may be improved by quantum computing. Hybrid techniques that integrate conventional and quantum algorithms are part of quantum machine learning. Instead of using standard data, quantum techniques may be utilized to examine quantum states. However, quantum algorithms have the potential to greatly expand current data science techniques. In this paper we review the contribution carried out by various researchers in the field of Quantum Machine Learning and later we look at certain techniques associated with it for its use.

International Conference on Emerging Research in Electronics, Computer Science and Technology (ICERECT)•Dec 26, 2022•13 citations

Numerical Techniques

Malte Henkel

Springer eBooks•Jan 1, 1999•0 citations

Algorithms and Computation

Masanori Ohya, Igor Vasil'evich Volovich

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

Classical algorithm techniques for decoding generic linear codes

Nicolas Sendrier

The security of code-based cryptosystems relies heavily on the hardness of decoding in an arbitrary linear code. The problem only has exponential solutions in the classical computing model, and it seems that it remains the case with quantum computing, placing code-based crypto among the so-called post-quantum cryptographic techniques. Even though quantum computer are not likely to allow generic decoding techniques with non-exponential complexity, it still allows some significant improvements. A few works have already explore this path. The purpose of this survey is not to propose new decoding techniques taking advantage a quantum computing. Instead we intend to give a comprehensive description of the main decoding techniques. The best techniques are recent (2011 and 2012) and are in fact finely tuned trade-offs between several very basic techniques. We will come back to those basics, which are the birthday decoding (based on the birthday paradox), and the Prange or Lee & Brickell algorithms (which are essentially enumerations). We feel that understanding each of those techniques in a quantum setting will simplify the search of an optimal quantum algorithm, and, hopefully, provide a simpler approach than directly "quantumize" the best known decoding techniques.

•Sep 9, 2013•0 citations
Privacy-Preserving Computation (PPC) comprises the techniques, schemes and protocols which ensure privacy and confidentiality in the context of secure computation and data analysis. Most of the current PPC techniques rely on the complexity of cryptographic operations, which are expected to be efficiently solved by quantum computers soon. This review explores how PPC can be built on top of quantum computing itself to alleviate these future threats. We analyze quantum proposals for Secure Multi-party Computation, Oblivious Transfer and Homomorphic Encryption from the last decade focusing on their maturity and the challenges they currently face. Our findings show a strong focus on purely theoretical works, but a rise on the experimental consideration of these techniques in the last 5 years. The applicability of these techniques to actual use cases is an underexplored aspect which could lead to the practical assessment of these techniques.
Over the course of the last seven decades the world of computing has taken revolutionary reformations in the scope of classical computing. Classical computers manipulate ones and zeroes to crunch through operations given to them by users. An innovative strategy known as quantum computing leverages the concepts of quantum physics to solve issues that are too complex for conventional computers to handle. Two of the domains of science that are now progressing the fastest are theoretical machine learning and quantum computing theory. In recent years, researchers have begun examining how classic machine learning techniques may be improved by quantum computing. Hybrid techniques that integrate conventional and quantum algorithms are part of quantum machine learning. Instead of using standard data, quantum techniques may be utilized to examine quantum states. However, quantum algorithms have the potential to greatly expand current data science techniques. In this paper we review the contribution carried out by various researchers in the field of Quantum Machine Learning and later we look at certain techniques associated with it for its use.
The security of code-based cryptosystems relies heavily on the hardness of decoding in an arbitrary linear code. The problem only has exponential solutions in the classical computing model, and it seems that it remains the case with quantum computing, placing code-based crypto among the so-called post-quantum cryptographic techniques. Even though quantum computer are not likely to allow generic decoding techniques with non-exponential complexity, it still allows some significant improvements. A few works have already explore this path. The purpose of this survey is not to propose new decoding techniques taking advantage a quantum computing. Instead we intend to give a comprehensive description of the main decoding techniques. The best techniques are recent (2011 and 2012) and are in fact finely tuned trade-offs between several very basic techniques. We will come back to those basics, which are the birthday decoding (based on the birthday paradox), and the Prange or Lee & Brickell algorithms (which are essentially enumerations). We feel that understanding each of those techniques in a quantum setting will simplify the search of an optimal quantum algorithm, and, hopefully, provide a simpler approach than directly "quantumize" the best known decoding techniques.