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

QP-PQ, quantum probability and white noise analysis

ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING

Satoshi Iriyama, Masanori Ohya, Igor Vasil'evich Volovich

Published Jan 1, 2013• 2 citations
Publisher
DOI
10.1142/9789814447546_0011

Related papers

A COMBINED QUANTUM ALGORITHM AND ITS COMPUTATIONAL COMPLEXITY

Satoshi Iriyama

Infinite Dimensional Analysis Quantum Probability and Related Topics•Nov 1, 2023•0 citations

Quantum algorithms for factorization problem

Xinhua Peng

•Sep 3, 2016•0 citations

QUANTUM ALGORITHM FOR PROTEIN FOLDING AND ITS COMPUTATIONAL COMPLEXITY

Satoshi Iriyama, Makoto Ohya, Ichiro Yamato

QP-PQ, quantum probability and white noise analysis•Mar 1, 2013•0 citations

Computational complexity and applications of quantum algorithm

Satoshi Iriyama, Makoto Ohya

Applied Mathematics and Computation•Jun 24, 2011•2 citations

TESTING OF ANALOG AND QUANTUM ORACLES OF LINEAR COMPUTATIONAL COMPLEXITY, PREDICTING THE VALUES OF THE CORRELATION COEFFICIENT ON A SMALL SAMPLE IN 32 EXPERIMENTS

Волчихин Владимир Иванович, A. I. Ivanov, A. V. Serikov +2 more

Известия высших учебных заведений. Поволжский регион. Технические науки•Jan 1, 2017•0 citations

Quantum Algorithms for Integer Factorization

Song Yuan Yan

Springer eBooks•Jan 1, 2015•0 citations