Results 121 to 130 of about 4,180,684 (277)
Quantum Computation as Geometry [PDF]
Quantum computers hold great promise for solving interesting computational problems, but it remains a challenge to find efficient quantum circuits that can perform these complicated tasks. Here we show that finding optimal quantum circuits is essentially equivalent to finding the shortest path between two points in a certain curved geometry.
Nielsen, Michael A. +3 more
openaire +5 more sources
Topological phonon blockade and its transfer via dark-mode engineering
Unidirectional topological behavior, engendered by imposing topological operations winding around an exceptional point, is sensitive to dark modes, which allow deactivating topological operations, resulting in a complete blockade of both mode conversion ...
Deng-Gao Lai +2 more
doaj +1 more source
Recall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization
A content-addressable memory (CAM) stores key-value associations such that the key is recalled by providing its associated value. While CAM recall is traditionally performed using recurrent neural network models, we show how to solve this problem using ...
Jonathan Schrock +4 more
doaj +1 more source
QUANTUM COMPUTATION BY MEASUREMENTS [PDF]
We first consider various methods for the indirect implementation of unitary gates. We apply these methods to rederive the universality of 4-qubit measurements based on a scheme much simpler than Nielsen's original construction [quant-ph/0108020]. Then, we prove the universality of simple discrete sets of 2-qubit measurements, again using a scheme ...
openaire +6 more sources
Quantum-coherent mixtures of causal relations
The set of causal relations that can connect two systems is much richer in the quantum world. Here the authors show that it is possible to have a coherent mixture of a cause-effect and a common-cause mechanism between two systems, realizing this in a ...
Jean-Philippe W. MacLean +3 more
doaj +1 more source
Classical computing, quantum computing, and Shor's factoring algorithm [PDF]
This is an expository talk written for the Bourbaki Seminar. After a brief introduction, Section 1 discusses in the categorical language the structure of the classical deterministic computations.
Manin, Yuri I.
core +3 more sources
We analyzed the application of quantum machine learning in histopathological cancer detection under adversarial attacks, demonstrating its potential to enhance diagnostic performance in adverse circumstances.
Biswaraj Baral +4 more
doaj +1 more source
We demonstrate the experimental feasibility of a Trojan-horse attack that remains nearly invisible to the single-photon detectors employed in practical quantum key distribution (QKD) systems, such as Clavis2 from ID Quantique.
Shihan Sajeed +3 more
doaj +1 more source
Noise Robustness of Quantum Relaxation for Combinatorial Optimization
Relaxation is a common way for dealing with combinatorial optimization problems. Quantum random-access optimization (QRAO) is a quantum-relaxation-based optimizer that uses fewer qubits than the number of bits in the original problem by encoding multiple
Kentaro Tamura +7 more
doaj +1 more source
NP-complete Problems and Physical Reality
Can NP-complete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adiabatic algorithms, quantum-mechanical nonlinearities, hidden variables ...
Aaronson, Scott
core +3 more sources

