Results 41 to 50 of about 259,803 (278)

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

Simulating quantum mechanics on a quantum computer [PDF]

, 1997
Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrodinger equation for interacting many-body systems are presented in some detail. These algorithms would make
Abrams, Barenco, Bialynicki-Birula, Boghosian, Boghosian, Bruce M. Boghosian, Deutsch, DiVincenzo, DiVincenzo, Ekert, Feynman, Feynman, Feynman, Frisch, Frisch, Grössing, Kogut, Lloyd, Lloyd, Lloyd, Margolus, Meyer, Meyer, Meyer, Nachtergaele, Nielsen, Schweber, Shor, Shor, Simon, Succi, Succi, Susskind, Washington Taylor, Wolfram   +34 more
core   +5 more sources

Variational quantum generative modeling by sampling expectation values of tunable observables

npj Quantum Information
Expectation 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, Andrii Kurkin, Adrián Pérez-Salinas, Elvira Shishenina, Vedran Dunjko, Hao Wang   +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

Polarization‐resolved femtosecond Vis/IR spectroscopy tailored for resolving weak signals in biological samples using minimal sample volume

FEBS Open Bio, EarlyView.
Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley   +1 more source

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

Quantum Emitters in Hexagonal Boron Nitride: Principles, Engineering and Applications

Advanced Functional Materials, EarlyView.
Quantum emitters in hexagonal boron nitride have emerged as a promising candidate for quantum information science. This review examines the fundamentals of these quantum emitters, including their level structures, defect engineering, and their possible chemical structures.
Thi Ngoc Anh Mai, Md Shakhawath Hossain, Nhat Minh Nguyen, Yongliang Chen, Chaohao Chen, Xiaoxue Xu, Quang Thang Trinh, Toan Dinh, Toan Trong Tran   +8 more
wiley   +1 more source

Analyzing variational quantum landscapes with information content

npj Quantum Information
The 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, Hao Wang, Xavier Bonet-Monroig   +2 more
doaj   +1 more source

Coreset Clustering on Small Quantum Computers

, 2020
Many quantum algorithms for machine learning require access to classical data in superposition. However, for many natural data sets and algorithms, the overhead required to load the data set in superposition can erase any potential quantum speedup over ...
Anschuetz, Eric R., Chong, Frederic T., Gokhale, Pranav, Tomesh, Teague   +3 more
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