Related papers: Quantum Bisimilarity is a Congruence under Physica…
Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control…
Quantum computing promises to provide the next step up in computational power for diverse application areas. In this review, we examine the science behind the quantum hype, and the breakthroughs required to achieve true quantum advantage in…
A proof of quantumness is a protocol through which a classical machine can test whether a purportedly quantum device, with comparable time and memory resources, is performing a computation that is impossible for classical computers.…
We are interested in the problem of characterizing the correlations that arise when performing local measurements on separate quantum systems. In a previous work [Phys. Rev. Lett. 98, 010401 (2007)], we introduced an infinite hierarchy of…
In a paper, Al-Qasimi [Physics Letters A 449 (2022) 128347] proposed a criterion for contextuality of two-qubit systems extending Peres' proof of contextuality [Phys. Lett. A 151 (1990) 107]. Using this criterion, Al-Qasimi argued that…
In a quantum computer any superposition of inputs evolves unitarily into the corresponding superposition of outputs. It has been recently demonstrated that such computers can dramatically speed up the task of finding factors of large…
We introduce a novel algorithm for the task of coherently controlling a quantum mechanical system to implement any chosen unitary dynamics. It performs faster than existing state of the art methods by one to three orders of magnitude…
The classical PCP theorem is arguably the most important achievement of classical complexity theory in the past quarter century. In recent years, researchers in quantum computational complexity have tried to identify approaches and develop…
Machine Learning classification models learn the relation between input as features and output as a class in order to predict the class for the new given input. Quantum Mechanics (QM) has already shown its effectiveness in many fields and…
Many problems of industrial interest are NP-complete, and quickly exhaust resources of computational devices with increasing input sizes. Quantum annealers (QA) are physical devices that aim at this class of problems by exploiting quantum…
We study supervised learning algorithms in which a quantum device is used to perform a computational subroutine - either for prediction via probability estimation, or to compute a kernel via estimation of quantum states overlap. We design…
We propose an implementation of a quantum computer to solve Deutsch's problem, which requires exponential time on a classical computer but only linear time with quantum parallelism. By using a dual-rail qubit representation as a simple form…
The production and manipulation of quantum correlation protocols will play a central role where the quantum nature of the correlation can be used as a resource to yield properties unachievable within a classical framework is a very active…
Concurrence is an important entanglement measure for states in finite-dimensional quantum systems that was explored intensively in the last decade. In this paper, we extend the concept of concurrence to infinite-dimensional bipartite…
Efficient implementations of concurrent objects such as atomic collections are essential to modern computing. Programming such objects is error prone: in minimizing the synchronization overhead between concurrent object invocations, one…
Quantum machine learning models have the potential to offer speedups and better predictive accuracy compared to their classical counterparts. However, these quantum algorithms, like their classical counterparts, have been shown to also be…
Quantum discord characterizes "non-classicality" of correlations in quantum mechanics. It has been proposed as the key resource present in certain quantum communication tasks and quantum computational models without containing much…
The quantum marginal problem is concerned with characterizing which collections of quantum states on different subsystems are compatible in the sense that they are the marginals of some multipartite quantum state. Presented here is a…
Symmetries in a Hamiltonian play an important role in quantum physics because they correspond directly with conserved quantities of the related system. In this paper, we propose quantum algorithms capable of testing whether a Hamiltonian…
Quantum computers solve intractable problems which classically require an exponentially long time to compute. With the development of large-scale experiments that claim quantum advantage, a vital issue has now emerged. What are the errors,…