Results 51 to 60 of about 260,825 (178)
Variational quantum generative modeling by sampling expectation values of tunable observables
npj Quantum InformationExpectation Value Samplers (EVSs) are quantum generative models that can learn high-dimensional continuous distributions by measuring the expectation values of parameterized quantum circuits. However, these models can demand impractical quantum resources
Kevin Shen +5 more
doaj +1 more source
Quantum algorithms for problems in number theory, algebraic geometry, and group theory
, 2012 Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same problem ...
Sasaki, Yoshitaka, van Dam, Wim
core +1 more source
Exponential quantum advantages in learning quantum observables from classical data
npj Quantum InformationQuantum computers are believed to bring computational advantages in simulating quantum many-body systems. However, recent works have shown that classical machine learning algorithms are able to predict numerous properties of quantum systems with ...
Riccardo Molteni +2 more
doaj +1 more source
Geometry of abstraction in quantum computation [PDF]
, 2009 Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke and Selinger. In
Pavlovic, Dusko
core +6 more sources
Quantum entanglement and quantum computational algorithms [PDF]
Pramana, 2001 9-pages latex, lecture given at the International Winter Institute on Foundations of Quantum Theory and Quantum Optics, SNBNCBS, Calcutta ...
openaire +2 more sources
Analyzing variational quantum landscapes with information content
npj Quantum InformationThe parameters of the quantum circuit in a variational quantum algorithm induce a landscape that contains the relevant information regarding its optimization hardness.
Adrián Pérez-Salinas +2 more
doaj +1 more source
Adiabatic quantum search algorithm for structured problems
, 2003 The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured ...
Cerf, Nicolas J., Roland, Jérémie
core +1 more source
Superlinear advantage for exact quantum algorithms [PDF]
, 2013 A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms.
Ambainis, Andris
core +1 more source
Shadows of quantum machine learning
Nature CommunicationsQuantum machine learning is often highlighted as one of the most promising practical applications for which quantum computers could provide a computational advantage.
Sofiene Jerbi +4 more
doaj +1 more source
A Survey on the Quantum Security of Block Cipher-Based Cryptography
IEEE AccessThe development of quantum computers represents an important advancement in computing, using quantum mechanics to address problems that were previously difficult to solve. This technological advancement poses a challenge for cryptographic systems.
S. E. Bootsma, M. De Vries
doaj +1 more source