Results 71 to 80 of about 260,825 (178)

A novel quantum algorithm for ant colony optimisation

IET Quantum Communication, 2022
Ant colony optimisation (ACO) is a commonly used meta‐heuristic to solve complex combinatorial optimisation problems like the travelling salesman problem (TSP), vehicle routing problem (VRP) etc.
Mrityunjay Ghosh, Nivedita Dey, Debdeep Mitra, Amlan Chakrabarti   +3 more
doaj   +1 more source

A Survey of Cryptographic Algorithms in Cybersecurity: From Classical Methods to Quantum-Resistant Solutions

Shifra, 2023
As quantum computing technology evolves, it poses greater risks to current cryptography schemes such as RSA and Elliptic Curve Cryptography (ECC), widely used to secure digital communications These classical algorithms are based on mathematical problems
Swapnali N Tambe-Jagtap
doaj   +1 more source

Learning density functionals from noisy quantum data

Machine Learning: Science and Technology
The search for useful applications of noisy intermediate-scale quantum (NISQ) devices in quantum simulation has been hindered by their intrinsic noise and the high costs associated with achieving high accuracy.
Emiel Koridon, Felix Frohnert, Eric Prehn, Evert van Nieuwenburg, Jordi Tura, Stefano Polla   +5 more
doaj   +1 more source

Noise resistance of adiabatic quantum computation using random matrix theory

, 2004
Besides the traditional circuit-based model of quantum computation, several quantum algorithms based on a continuous-time Hamiltonian evolution have recently been introduced, including for instance continuous-time quantum walk algorithms as well as ...
A. M. Childs, A. M. Childs, D. Aharonov, G. P. Agrawal, H.-J. Stöckmann, Jérémie Roland, L. I. Schiff, Nicolas J. Cerf, W. B. Davenport, W. van Dam   +9 more
core   +1 more source

Deriving Three-Outcome Permutationally Invariant Bell Inequalities

Entropy
We present strategies to derive Bell inequalities valid for systems composed of many three-level parties. This scenario is formalized by a Bell experiment with N observers, each of which performs one out of two possible three-outcome measurements on ...
Albert Aloy, Guillem Müller-Rigat, Jordi Tura, Matteo Fadel   +3 more
doaj   +1 more source

Variational quantum compiling with double Q-learning

New Journal of Physics, 2021
Quantum compiling aims to construct a quantum circuit V by quantum gates drawn from a native gate alphabet, which is functionally equivalent to the target unitary U . It is a crucial stage for the running of quantum algorithms on noisy intermediate-scale
Zhimin He, Lvzhou Li, Shenggen Zheng, Yongyao Li, Haozhen Situ   +4 more
doaj   +1 more source

Quantum generative modeling for financial time series with temporal correlations

Machine Learning: Science and Technology
Quantum generative adversarial networks (QGANs) have been investigated as a method for generating synthetic data with the goal of augmenting training data sets for neural networks. This is especially relevant for financial time series, since we only ever
David Dechant, Eliot Schwander, Lucas van Drooge, Charles Moussa, Diego Garlaschelli, Vedran Dunjko, Jordi Tura   +6 more
doaj   +1 more source

Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning

Machine Learning: Science and Technology
Quantum repeaters play a crucial role in the effective distribution of entanglement over long distances. The nearest-future type of quantum repeater requires two operations: entanglement generation across neighbouring repeaters and entanglement swapping ...
Jan Li, Tim Coopmans, Patrick Emonts, Kenneth Goodenough, Jordi Tura, Evert van Nieuwenburg   +5 more
doaj   +1 more source

Discovering emergent connections in quantum physics research via dynamic word embeddings

Machine Learning: Science and Technology
As the field of quantum physics evolves, researchers naturally form subgroups focusing on specialized problems. While this encourages in-depth exploration, it can limit the exchange of ideas across structurally similar problems in different subfields. To
Felix Frohnert, Xuemei Gu, Mario Krenn, Evert van Nieuwenburg   +3 more
doaj   +1 more source

Type-II Quantum Algorithms

, 2005
We review and analyze the hybrid quantum-classical NMR computing methodology referred to as Type-II quantum computing. We show that all such algorithms considered so far within this paradigm are equivalent to some classical lattice-Boltzmann scheme.
Berman, Boghosian, Boghosian, Bruce M. Boghosian, Chuang, Cory, Higuera, Meyer, Peter J. Love, Pravia, Succi, Vahala, Vahala, Yepez, Yepez, Yepez, Yepez, Yepez   +17 more
core   +2 more sources