Related papers: A quantum algorithm for finding collision-inducing…
The search for new physics beyond the Standard Model is one of the central problems of current high energy physics interest. As the luminosities of current and near-future colliders continue to increase, the search for new physics has…
We experimentally and numerically investigate the quantum accelerator mode dynamics of an atom optical realization of the quantum delta-kicked accelerator, whose classical dynamics are chaotic. Using a Ramsey-type experiment, we observe…
We introduce two quantum algorithms for solving structured prediction problems. We first show that a stochastic gradient descent that uses the quantum minimum finding algorithm and takes its probabilistic failure into account solves the…
Quantum search is a technique for searching N possibilities in only O(sqrt(N)) steps. It has been applied in the design of quantum algorithms for several structured problems. Many of these algorithms require significant amount of quantum…
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard. There is a highly inefficient `basic algorithm'…
We propose a novel approach to charged particle tracking at high intensity particle colliders based on Approximate Nearest Neighbors search. With hundreds of thousands of measurements per collision to be reconstructed e.g. at the High…
Identifying jets formed in high-energy particle collisions requires solving optimization problems over potentially large numbers of final-state particles. In this work, we consider the possibility of using quantum computers to speed up jet…
Simulations of collisions of fundamental particles on a quantum computer are expected to have an exponential advantage over classical methods and promise to enhance searches for new physics. Furthermore, scattering in scalar field theory…
Scaling the size of monolithic quantum computer systems is a difficult task. As the number of qubits within a device increases, a number of factors contribute to decreases in yield and performance. To meet this challenge, distributed…
A novel cryptography method based on the Lorenz's attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction…
Quantum algorithms are promising candidates for the enhancement of computational efficiency for a variety of computational tasks, allowing for the numerical study of physical systems intractable to classical computers. In the Noisy…
Entanglement based quantum communication offers an increased level of security in practical secret shared key distribution. One of the fundamental principles enabling this security -- the fact that interfering with one photon will destroy…
The ultimate goal of any sparse coding method is to accurately recover from a few noisy linear measurements, an unknown sparse vector. Unfortunately, this estimation problem is NP-hard in general, and it is therefore always approached with…
The efficient computation of observables beyond the total energy is a key challenge and opportunity for fault-tolerant quantum computing approaches in quantum chemistry. Here we consider the symmetry-adapted perturbation theory (SAPT)…
Quantum information encoded into superposition of coherent states is an illustrative representative of practical applications of macroscopic quantum coherence possessing. However, these states are very sensitive to energy loss, losing their…
Quantum-based cryptographic protocols are often said to enjoy security guaranteed by the fundamental laws of physics. However, even carefully designed quantum-based cryptographic schemes may be susceptible to subtle attacks that are outside…
In this study, we propose a new method for constrained combinatorial optimization using variational quantum circuits. Quantum computers are considered to have the potential to solve large combinatorial optimization problems faster than…
We propose a circuit-level attack, SQUASH, a SWAP-Based Quantum Attack to sabotage Hybrid Quantum Neural Networks (HQNNs) for classification tasks. SQUASH is executed by inserting SWAP gate(s) into the variational quantum circuit of the…
Fault-tolerant quantum computation (FTQC) is expected to address a wide range of computational problems. To realize large-scale FTQC, it is essential to encode logical qubits using quantum error-correcting codes. High-rate concatenated…
We consider two combinatorial problems. The first we call "search with wildcards": given an unknown n-bit string x, and the ability to check whether any subset of the bits of x is equal to a provided query string, the goal is to output x.…