Related papers: Quantum convolution and quantum correlation algori…
Experimental attempts to implement quantum speedup of computations over the past 30 years have yielded a negative result, despite the absence of physical laws prohibiting such speedup. The article formulates the limitation of quantum…
Machine learning, a branch of artificial intelligence, learns from previous experience to optimize performance, which is ubiquitous in various fields such as computer sciences, financial analysis, robotics, and bioinformatics. A challenge…
A quantum computer is a multi-particle interferometer that comprises beam splitters at both ends and arms, where the n two-level particles undergo the interactions among them. The arms are designed so that relevant functions required to…
A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism,' but rather because the structure of a quantum state space allows new sorts of…
Entanglement has been termed a critical resource for quantum information processing and is thought to be the reason that certain quantum algorithms, such as Shor's factoring algorithm, can achieve exponentially better performance than their…
As we begin to reach the limits of classical computing, quantum computing has emerged as a technology that has captured the imagination of the scientific world. While for many years, the ability to execute quantum algorithms was only a…
Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we…
Classical information encoded in composite quantum states can be completely hidden from the reduced subsystems and may be found only in the correlations. Can the same be true for quantum information? If quantum information is hidden from…
The usual representation of quantum algorithms, limited to the process of solving the problem, is physically incomplete. We complete it in three steps: (i) extending the representation to the process of setting the problem, (ii)…
It is well known that many operations in quantum information processing depend largely on a special kind of quantum correlation, that is, entanglement. However, there are also quantum tasks that display the quantum advantage without…
The frame of classical probability theory can be generalized by enlarging the usual family of random variables in order to encompass nondeterministic ones: this leads to a frame in which two kinds of correlations emerge: the classical…
Entanglement is often regarded as an inherently quantum feature. We show that this does not have to be the case: under restricted operational access, classical correlations can appear nonseparable when expressed in the formalism of quantum…
Quantum computing hardware has grown sufficiently complex that it often can no longer be simulated by classical computers, but its computational power remains limited by errors. These errors corrupt the results of quantum algorithms, and it…
Quantum entanglement is known as a unique quantum feature that cannot be obtained by classical physics. Over the last several decades, however, such an understanding on quantum entanglement might have confined us in a limited world of weird…
This paper discusses the compilation, optimization, and error mitigation of quantum algorithms, essential steps to execute real-world quantum algorithms. Quantum algorithms running on a hybrid platform with QPU and CPU/GPU take advantage of…
We show that quantum theory allows for transformations of black boxes that cannot be realized by inserting the input black boxes within a circuit in a pre-defined causal order. The simplest example of such a transformation is the classical…
The problem of efficient multiplication of large numbers has been a long-standing challenge in classical computation and has been extensively studied for centuries. It appears that the existing classical algorithms are close to their…
Quantum no-cloning, the impossibility of perfectly cloning an arbitrary unknown quantum state, is one of the most fundamental limitations due to the laws of quantum mechanics, which underpin the physical security of quantum key…
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…
Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by having it follow from…