Results 31 to 40 of about 22,658 (300)
An Overview of Quantum Algorithms: From Quantum Supremacy to Shor Factorization [PDF]
2020 IEEE International Symposium on Circuits and Systems (ISCAS), 2020 Recently, a team of scientists from Google claims to have carried a computation on their noisy, intermediate-scale quantum (NISQ) computer which no regular computer can achieve. A feat that is sometimes referred as quantum supremacy. In the first part of this work, we explain their approach, their randomised circuit construction and the consequences of
Subhasree Patro, Álvaro Piedrafita
openalex +2 more sources
Nonadaptive fault-tolerant verification of quantum supremacy with noise [PDF]
Quantum, 2019 Quantum samplers are believed capable of sampling efficiently from distributions that are classically hard to sample from. We consider a sampler inspired by the classical Ising model. It is nonadaptive and therefore experimentally amenable.
Theodoros Kapourniotis, Animesh Datta
doaj +1 more source
Time-resolved boson sampling with photons of different colors [PDF]
, 2018 Interference of multiple photons via a linear-optical network has profound applications for quantum foundation, quantum metrology and quantum computation.
Bao, Xiao-Hui +7 more
core +2 more sources
Learning the dynamics of open quantum systems from their steady states
New Journal of Physics, 2020 Recent works have shown that generic local Hamiltonians can be efficiently inferred from local measurements performed on their eigenstates or thermal states.
Eyal Bairey +4 more
doaj +1 more source
Hardness of efficiently generating ground states in postselected quantum computation
Physical Review Research, 2021 Generating ground states of any local Hamiltonians seems to be impossible in quantum polynomial time. In this paper, we give evidence for the impossibility by applying an argument used in the quantum-computational-supremacy approach.
Yuki Takeuchi +2 more
doaj +1 more source
From Quantum Cheating to Quantum Security [PDF]
, 2000 For thousands of years, code-makers and code-breakers have been competing for supremacy. Their arsenals may soon include a powerful new weapon: quantum mechanics. We give an overview of quantum cryptology as of November 2000.Comment: 14 pages, 4 figures.
Gottesman, Daniel, Lo, Hoi-Kwong
core +4 more sources
Sensors, 2022 Sixth-generation wireless (6G) technology has been focused on in the wireless research community. Global coverage, massive spectrum usage, complex new applications, and strong security are among the new paradigms introduced by 6G. However, realizing such
Helen Urgelles +3 more
doaj +1 more source
Fine-grained quantum computational supremacy [PDF]
quantum Information and Computation, 2019 (pp1089-1115) Tomoyuki Morimae and Suguru Tamaki doi: https://doi.org/10.26421/QIC19.13-14-2 Abstracts: Output probability distributions of several sub-universal quantum computing models cannot be classically efficiently sampled unless some unlikely consequences occur in classical complexity theory, such as the collapse of the ...
Tomoyuki Morimae, Suguru Tamaki
openaire +2 more sources
Quantum supremacy and hardness of estimating output probabilities of quantum circuits [PDF]
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022 Motivated by the recent experimental demonstrations of quantum supremacy, proving the hardness of the output of random quantum circuits is an imperative near term goal. We prove under the complexity theoretical assumption of the non-collapse of the polynomial hierarchy that approximating the output probabilities of random quantum circuits to within ...
Yasuhiro Kondo +2 more
openaire +2 more sources
Physical Review Research, 2020 Parametrized quantum evolution is the main ingredient in variational quantum algorithms for near-term quantum devices. In digital quantum computing, it has been shown that random parametrized quantum circuits are able to express complex distributions ...
Jirawat Tangpanitanon +4 more
doaj +1 more source