Results 21 to 30 of about 61 (48)

Single query learning from abelian and non-abelian Hamming distance oracles [PDF]

, 2009
We study the problem of identifying an n-bit string using a single quantum query to an oracle that computes the Hamming distance between the query and hidden strings. The standard action of the oracle on a response register of dimension r is by powers of
Meyer, David A., Pommersheim, James
core   +1 more source

Quantum Computing for Financial Mathematics

, 2023
Quantum computing has recently appeared in the headlines of many scientific and popular publications.
Jacquier, Antoine, Kondratyev, Oleksiy, Lee, Gordon, Oumgari, Mugad   +3 more
core  

A Comprehensive Review of Matrix Equations in Dynamical Systems and Control Theory

Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.
Matrix equations are of foundational importance in the modeling, investigation, and control of dynamical systems. This review discusses various classes of matrix equations, their solutions, and their relevance in control theory and dynamical systems.
Chacha Stephen Chacha, Arpan Hazra
wiley   +1 more source

Quantum Algorithms for Boolean Equation Solving and Quantum Algebraic Attack on Cryptosystems [PDF]

, 2018
Decision of whether a Boolean equation system has a solution is an NPC problem and finding a solution is NP hard. In this paper, we present a quantum algorithm to decide whether a Boolean equation system FS has a solution and compute one if FS does have ...
Chen, Yu-Ao, Gao, Xiao-Shan
core   +1 more source

Quantum Analog of Shannon's Lower Bound Theorem

, 2023
Shannon proved that almost all Boolean functions require a circuit of size $\Theta(2^n/n)$. We prove a quantum analog of this classical result. Unlike in the classical case the number of quantum circuits of any fixed size that we allow is uncountably ...
Basu, Saugata, Parida, Laxmi
core  

A small serving of mash: (Quantum) algorithms for SPDH-Sign with small parameters

Journal of Mathematical Cryptology
We find an efficient method to solve the semidirect discrete logarithm problem (SDLP) over finite nonabelian groups of order p3{p}^{3} and exponent p2{p}^{2} for certain exponentially large parameters. This implies an attack on SPDH-Sign,Pronounced “SPUD-
Mendelsohn Andrew, Dable-Heath Edmund, Ling Cong   +2 more
doaj   +1 more source

Quantum Security of the Legendre PRF [PDF]

, 2021
International audienceIn this paper, we study the security of the Legendre PRF against quantum attackers, given classical queries only, and without quantum random-access memories.
Frixons, Paul, Schrottenloher, André
core   +1 more source

Introducció matemàtica a la computació quàntica [PDF]

, 2013
El propòsit d'aquest article és exposar les nocions essencials de la computació quàntica en termes purament matemàtics. En particular, definim les nocions de q-computació, q-mesura, q-procediment, q-computador i q-algorisme, i cadascuna s'il.lustra amb ...
Rué, Juanjo, Xambó, Sebastià
core  

Universal Approximation Theorem and error bounds for quantum neural networks and quantum reservoirs

, 2023
Universal approximation theorems are the foundations of classical neural networks, providing theoretical guarantees that the latter are able to approximate maps of interest.
Gonon, Lukas, Jacquier, Antoine
core  

The dihedral hidden subgroup problem

Journal of Mathematical Cryptology
The hidden subgroup problem (HSP) is a cornerstone problem in quantum computing, which captures many problems of interest and provides a standard framework algorithm for their study based on Fourier sampling, one class of techniques known to provide ...
Chen Imin, Sun David
doaj   +1 more source