Related papers: Quantum interference as a resource for quantum spe…
Quantum machine learning algorithms could provide significant speed-ups over their classical counterparts; however, whether they could also achieve good generalization remains unclear. Recently, two quantum perceptron models which give a…
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…
Current quantum simulators suffer from multiple limitations such as short coherence time, noisy operations, faulty readout and restricted qubit connectivity in some platforms. Variational quantum algorithms are the most promising approach…
Quantum computers process information with the laws of quantum mechanics. Current quantum hardware is noisy, can only store information for a short time, and is limited to a few quantum bits, i.e., qubits, typically arranged in a planar…
Photons are ideal carriers for quantum information as they can have a long coherence time and can be transmitted over long distances. These properties are a consequence of their weak interactions within a nearly linear medium. To create and…
This PhD thesis explores the potential of quantum computing to address computational challenges in high-energy physics (HEP). As the Standard Model (SM) leaves key questions unanswered and no signs of new physics have emerged since the…
This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of…
Phase plays a crucial role in many quantum effects including interference. Phase is normally defined in terms of complex numbers that appear when representing quantum states as complex vectors. Here we give an operational definition whereby…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
Significant advances in the development of computing devices based on quantum effects and the demonstration of their use to solve various problems have rekindled interest in the nature of the "quantum computational advantage." Although…
Perturbation theory is an important technique for reducing computational cost and providing physical insights in simulating quantum systems with classical computers. Here, we provide a quantum algorithm to obtain perturbative energies on…
The ability of matter to be superposed at two different locations while being intrinsically connected by a quantum phase is among the most counterintuitive predictions of quantum physics. While such superpositions have been created for a…
Quantum search is among the most important algorithms in quantum computing. At its core is quantum amplitude amplification, a technique that achieves a quadratic speedup over classical search by combining two global reflections: the oracle,…
Quantum networks connect systems at separate locations via quantum links, enabling a wide range of quantum information tasks between distant parties. Large-scale networks have the potential to enable global secure communication, distributed…
We consider a generalized model of repeated quantum interactions, where a system $\mathcal{H}$ is interacting in a random way with a sequence of independent quantum systems $\mathcal{K}_n, n \geq 1$. Two types of randomness are studied in…
The resource theory of coherence studies the operational value of superpositions in quantum technologies. A key question in this theory concerns the efficiency of manipulation and inter-conversion of the resource. Here we solve this…
A unified conceptual foundation of classical and quantum physics is given, free of undefined terms. Ensembles are defined by extending the `probability via expectation' approach of Whittle to noncommuting quantities. This approach carries…
Quantum backflow is usually understood as a quantum interference phenomenon where probability current of a quantum particle points in the opposite direction to particle's momentum. Here, we quantify the amount of quantum backflow for…
We study randomized and quantum efficiency lower bounds in communication complexity. These arise from the study of zero-communication protocols in which players are allowed to abort. Our scenario is inspired by the physics setup of Bell…
Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost…