Results 31 to 40 of about 327,655 (287)

High-Precision Voltage Measurement for Optical Quantum Computation

Energies, 2022
This paper presents a theoretical study into the use of optical systems for quantum computation. The study results pertain to quantum sampling and quantum communication and provide a basis for further research and the development of a physical ...
Kamil Wereszczyński, Agnieszka Michalczuk, Marcin Paszkuta, Jacek Gumiela   +3 more
doaj   +1 more source

Exploiting Symmetry Reduces the Cost of Training QAOA

IEEE Transactions on Quantum Engineering, 2021
A promising approach to the practical application of the quantum approximate optimization algorithm (QAOA) is finding QAOA parameters classically in simulation and sampling the solutions from QAOA with optimized parameters on a quantum computer. Doing so
Ruslan Shaydulin, Stefan M. Wild
doaj   +1 more source

On the construction of model Hamiltonians for adiabatic quantum computation and its application to finding low energy conformations of lattice protein models [PDF]

, 2008
In this report, we explore the use of a quantum optimization algorithm for obtaining low energy conformations of protein models. We discuss mappings between protein models and optimization variables, which are in turn mapped to a system of coupled ...
A. Messiah, Alejandro Perdomo, Alán Aspuru-Guzik, B. Berger, C. J. Epstein, Colin Truncik, E. Boros, F. L. Custodio, G. A. Cox, Geordie Rose, Ivan Tubert-Brohman, K. Dill, K. Rosen, L. Toma, P. Crescenzi, S. Bravyi, S. S. Plotkin, T. C. Beutler   +17 more
core   +2 more sources

Quantum Optimal Transport is Cheaper [PDF]

Journal of Statistical Physics, 2020
We compare bipartite (Euclidean) matching problems in classical and quantum mechanics. The quantum case is treated in terms of a quantum version of the Wasserstein distance introduced in [F. Golse, C. Mouhot, T. Paul, Commun. Math. Phys. 343 (2016), 165-205]. We show that the optimal quantum cost can be cheaper than the classical one.
Caglioti E., Golse F., Paul T.
openaire   +4 more sources

Constructing elliptic curve isogenies in quantum subexponential time

Journal of Mathematical Cryptology, 2014
Given two ordinary elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit a nonzero isogeny between them, but finding such an isogeny is believed to be computationally difficult.
Childs Andrew, Jao David, Soukharev Vladimir   +2 more
doaj   +1 more source

Training a quantum optimizer

Physical Review A, 2016
We study a variant of the quantum approximate optimization algorithm [ E. Farhi, J. Goldstone, and S. Gutmann, arXiv:1411.4028] with slightly different parametrization and different objective: rather than looking for a state which approximately solves an optimization problem, our goal is to find a quantum algorithm that, given an instance of MAX-2-SAT,
Wecker, D., Hastings, M. B., Troyer, M.
openaire   +3 more sources

Multilayer Optimization for the Quantum Internet [PDF]

Scientific Reports, 2018
AbstractWe define a multilayer optimization method for the quantum Internet. Multilayer optimization integrates separate procedures for the optimization of the quantum layer and the classical layer of the quantum Internet. The multilayer optimization procedure defines advanced techniques for the optimization of the layers.
Gyongyosi, Laszlo, Imre, Sandor
openaire   +5 more sources

Optimal Protocols in Quantum Annealing and Quantum Approximate Optimization Algorithm Problems [PDF]

Physical Review Letters, 2021
Quantum annealing (QA) and the quantum approximate optimization algorithm (QAOA) are two special cases of the following control problem: apply a combination of two Hamiltonians to minimize the energy of a quantum state. Which is more effective has remained unclear.
Lucas T. Brady, Christopher L. Baldwin, Aniruddha Bapat, Yaroslav Kharkov, Alexey V. Gorshkov   +4 more
openaire   +2 more sources

Experimental implementation of an adiabatic quantum optimization algorithm [PDF]

, 2003
We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm.
A. Aharonov, A. Messiah, D. G. Cory, E. Farhi, F. Barahona, G. Ausiello, Greg Breyta, H. F. Trotter, Isaac Chuang, Matthias Steffen, P. Shor, R. Ernst, Tad Hogg, W. van Dam, Wim van Dam   +14 more
core   +2 more sources

Optimal Blind Quantum Computation [PDF]

Physical Review Letters, 2013
Blind quantum computation allows a client with limited quantum capabilities to interact with a remote quantum computer to perform an arbitrary quantum computation, while keeping the description of that computation hidden from the remote quantum computer.
Mantri, A., Pérez-Delgado, C.A., Fitzsimons, J.F.   +2 more
openaire   +3 more sources