Известия высших учебных заведений. Поволжский регион. Технические науки

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, "Rubin" enterprise, Yu. I. Serikova

Published Jan 1, 2017• 0 citations

Related papers

A COMBINED QUANTUM ALGORITHM AND ITS COMPUTATIONAL COMPLEXITY

Satoshi Iriyama

An Empirical Investigation into Quantum Algorithms

Himanshak Chawla, Ritika Wason, Parul Arora +1 more

ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING

Satoshi Iriyama, Masanori Ohya, Igor Vasil'evich Volovich

Algorithms and computational complexity in quantum simulation and quantum machine learning

B. Jobst, Frank Pollmann, Technische Universität München

QUANTUM ALGORITHM FOR PROTEIN FOLDING AND ITS COMPUTATIONAL COMPLEXITY

Satoshi Iriyama, Makoto Ohya, Ichiro Yamato

Simulating quantum correlations as a distributed sampling problem (9 pages)

Julien Degorre, Sophie Laplante