Related papers: Generalization and Demonstration of an Entanglemen…
Entanglement of quantum variables is usually thought to be a prerequisite for obtaining quantum speed-ups of information processing tasks such as searching databases. This paper presents methods for quantum search that give a speed-up over…
We discuss two qualities of quantum systems: various correlations existing between their subsystems and the distingushability of different quantum states. This is then applied to analysing quantum information processing. While quantum…
In these notes we present preliminary results on quantum-like algorithms where tensor product is replaced by geometric product. Such algorithms possess the essential properties typical of quantum computation (entanglement, parallelism) but…
Recently, the entanglement dynamics of two harmonic oscillators initially prepared in a separable-coherent state was demonstrated to offer a pathway for prime number identification. This article presents a generalized approach and outlines…
The simulation of large-scale classical systems in exponentially small space on quantum computers has gained attention. The prior work demonstrated that a quantum algorithm offers an exponential speedup over any classical algorithm in…
In a quantum computation with pure states, the generation of large amounts of entanglement is known to be necessary for a speedup with respect to classical computations. However, examples of quantum computations with mixed states are known,…
It is presently shown that the Deutsch-Jozsa algorithm is connected to the concept of bent function. Particularly, it is noticeable that the quantum circuit used to denote the well known quantum algorithm is by itself the quantum computer…
Classical deep learning algorithms have aroused great interest in both academia and industry for their utility in image recognition, language translation, decision-making problems and more. In this work, we have provided a quantum deep…
The main promise of quantum computing is to efficiently solve certain problems that are prohibitively expensive for a classical computer. Most problems with a proven quantum advantage involve the repeated use of a black box, or oracle,…
In 1985, David Deutsch challenged the Church-Turing thesis by stating that his quantum model of computation "could, in principle, be built and would have many remarkable properties not reproducible by any Turing machine". While this is…
The Deustch-Jozsa problem is one of the most basic ways to demonstrate the power of quantum computation. Consider a Boolean function f : {0,1}^n to {0,1} and suppose we have a black-box to compute f. The Deutsch-Jozsa problem is to…
Entanglement constitutes a key characteristic feature of quantum matter. Its detection, however, still faces major challenges. In this letter, we formulate a framework for probing entanglement based on machine learning techniques. The…
Deutsch-Jozsa (DJ) problem is one of the most important problems demonstrating the power of quantum algorithm. DJ problem can be described as a Boolean function $f$: $\{0,1\}^n\rightarrow \{0,1\}$ with promising it is either constant or…
A classical analogue of Deutsch and Jozsa's algorithm is given and its implications on quantum computing is discussed
An outstanding problem in quantum computing is the calculation of entanglement, for which no closed-form algorithm exists. Here we solve that problem, and demonstrate the utility of a quantum neural computer, by showing, in simulation, that…
Coordination in distributed systems is often hampered by communication latency, which degrades performance. Quantum entanglement offers fundamentally stronger correlations than classically achievable without communication. Crucially, these…
The well-known Deutsch Algorithm (DA) and Deutsch-Jozsha Algorithm (DJA) both are used as an evidence to the power of quantum computers over classical computation mediums. In these theoretical experiments, it has been shown that a quantum…
Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector $\mathbf{b}$ is encoded in the amplitudes of a quantum state $\left |b \right >$. However, efficiently…
Quantum algorithms that can speed up certain tasks, such as factorisation and unstructured search, have driven a decades-long development of quantum computers and quantum technologies. Yet, outside specialized applications, quantum…
The aim of this dissertation is to clarify the debate over the explanation of quantum speedup and to submit a tentative resolution to it. In particular, I argue that the physical explanation for quantum speedup is precisely the fact that…