Related papers: Quantum interference as a resource for quantum spe…
The one clean qubit model of quantum computation (DQC1) efficiently implements a computational task that is not known to have a classical alternative. During the computation, there is never more than a small but finite amount of…
Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of…
A recently proposed model of the Dirac electron, which describes observed properties of the particle correctly, is in the present paper shown to be also able to explain quantum interference by classical probabilities. According to this…
Quantum computers promise significant speedups in solving problems intractable for conventional computers but, despite recent progress, remain limited in scaling and availability. Therefore, quantum software and hardware development heavily…
Coherently manipulating multipartite quantum correlations leads to remarkable advantages in quantum information processing. A fundamental question is whether such quantum advantages persist only by exploiting multipartite correlations, such…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…
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…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
Quantum information processing is at the crossroads of physics, mathematics and computer science. It is concerned with that we can and cannot do with quantum information that goes beyond the abilities of classical information processing…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…
In this article, we propose a general principle of quantum interference for quantum system, and based on this we propose a new type of computing machine, the duality computer, that may outperform in principle both classical computer and the…
Quantum tunneling is the phenomenon that makes superconducting circuits "quantum". Recently, there has been a renewed interest in using quantum tunneling in phase space of a Kerr parametric oscillator as a resource for quantum information…
If the interaction between qubits in a quantum computer has a non-diagonal form (e.g. the Heisenberg interaction), then one must be able to "switch it off" in order to prevent uncontrolled propagation of states. Therefore, such QC schemes…
Run-times of quantum algorithms are often studied via an asymptotic, worst-case analysis. Whilst useful, such a comparison can often fall short: it is not uncommon for algorithms with a large worst-case run-time to end up performing well on…
In quantum information and communication one looks for the non-classical features like interference and quantum correlations to harness the true power of composite systems. We show how the concept akin to interference is, in fact,…
We show that quantum interference can be classically interpreted in terms of a phase invariant quantity, not unlike the Berry's phase. Under this interpretation, closed loops in time become fundamental quantum entities, and all quantum…
Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms. Quantum walks on graphs are fundamentally different from…
Quantum computation is a novel way of information processing which allows, for certain classes of problems, exponential speedups over classical computation. Various models of quantum computation exist, such as the adiabatic, circuit and…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…
Despite intensive research, the physical origin of the speed-up offered by quantum algorithms remains mysterious. No general physical quantity, like, for instance, entanglement, can be singled out as the essential useful resource. Here we…