Zobrazeno 1 - 10
of 1 336
pro vyhledávání: '"Wallden, P."'
Due to its fundamental principles, quantum theory holds the promise to enhance the security of modern cryptography, from message encryption to anonymous communication, digital signatures, online banking, leader election, one-time passwords and delega
Externí odkaz:
http://arxiv.org/abs/2411.08877
Oblivious transfer is a fundamental cryptographic primitive which is useful for secure multiparty computation. There are several variants of oblivious transfer. We consider 1 out of 2 oblivious transfer, where a sender sends two bits of information t
Externí odkaz:
http://arxiv.org/abs/2409.17571
Autor:
Newton, Derrick
A quantum digital signature (QDS) protocol is investigated in respect of an attacker who can impersonate other communicating principals in the style of Lowe's attack on the Needham-Schroeder public-key authentication protocol. A man-in-the-middle att
Externí odkaz:
http://arxiv.org/abs/1509.03843
Autor:
Doosti, Mina, Wallden, Petros, Hamill, Conor Brian, Hankache, Robert, Brown, Oliver Thomson, Heunen, Chris
This review paper examines state-of-the-art algorithms and techniques in quantum machine learning with potential applications in finance. We discuss QML techniques in supervised learning tasks, such as Quantum Variational Classifiers, Quantum Kernel
Externí odkaz:
http://arxiv.org/abs/2407.12618
Autor:
Ferguson, Stuart, Wallden, Petros
Quantum computers theoretically promise computational advantage in many tasks, but it is much less clear how such advantage can be maintained when using existing and near-term hardware that has limitations in the number and quality of its qubits. One
Externí odkaz:
http://arxiv.org/abs/2405.04247
Finding the shortest vector in a lattice is a problem that is believed to be hard both for classical and quantum computers. Many major post-quantum secure cryptosystems base their security on the hardness of the Shortest Vector Problem (SVP). Finding
Externí odkaz:
http://arxiv.org/abs/2402.13895
Current quantum hardware prohibits any direct use of large classical datasets. Coresets allow for a succinct description of these large datasets and their solution in a computational task is competitive with the solution on the original dataset. The
Externí odkaz:
http://arxiv.org/abs/2402.01529
Autor:
Kolotouros, Ioannis, Wallden, Petros
Publikováno v:
Quantum 8, 1503 (2024)
Hybrid quantum-classical algorithms appear to be the most promising approach for near-term quantum applications. An important bottleneck is the classical optimization loop, where the multiple local minima and the emergence of barren plateaux make the
Externí odkaz:
http://arxiv.org/abs/2311.04135
Publikováno v:
Quantum Science and Technology, 10, 015003, 2025
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term devices, a
Externí odkaz:
http://arxiv.org/abs/2206.04373
In the histories formulation of quantum theory, sets of coarse-grained histories, that are called consistent, obey classical probability rules. It has been argued that these sets can describe the semi-classical behaviour of closed quantum systems. Mo
Externí odkaz:
http://arxiv.org/abs/2205.15893