Related papers: Footprints of quantum pigeons
We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device with limited connectivity, and the other is a…
Quantum walks of correlated particles offer the possibility to study large-scale quantum interference, simulate biological, chemical and physical systems, and a route to universal quantum computation. Here we demonstrate quantum walks of…
Inspired by recent breakthroughs with topological quantum materials, which pave the way to novel, high-efficiency, low-energy magnetoelectric devices and fault-tolerant quantum information processing, inter alia, topological quantum walks…
We propose a solution to the quantum measurement paradox by first identifying its classical counterpart.
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…
This is an analysis of some aspects of an old but still controversial topic, superluminal quantum tunneling. Some features of quantum tunneling described in literature, such as definition of the tunneling time and a frequency range of a…
We describe a quantum particle constrained on a catenoid, employing an effective description of quantum mechanics based on expected values of observables and quantum dispersions. We obtain semiclassical trajectories for particles,…
Artificial atoms realized by superconducting circuits offer unique opportunities to store and process quantum information with high fidelity. Among them, implementations of circuits that harness intrinsic noise protection have been rapidly…
We review canonical experiments on systems that have pushed the boundary between the quantum and classical worlds towards much larger scales, and discuss their unique features that enable quantum coherence to survive. Because the types of…
The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing…
Free motion of a quantum particle with the wave function entirely comprised of plane waves with non-negative momenta may be accompanied by negative probability current, an effect called quantum backflow. The effect is weak and fragile, and…
Quantum systems are notoriously difficult to simulate with classical means. Recently, the idea of using another quantum system - which is experimentally more controllable - as a simulator for the original problem has gained significant…
The Weltanschauung emerging from quantum theory clashes profoundly with our classical concepts. Quantum characteristics like superposition, entanglement, wave-particle duality, nonlocality, contextuality are difficult to reconcile with our…
Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In…
An increasing number of communication and computational schemes with quantum advantages have recently been proposed, which implies that quantum technology has fertile application prospects. However, demonstrating these schemes…
Simulating quantum many-body systems on a classical computer generally requires a computational cost that grows exponential with the number of particles. This computational complexity has been the main obstacle to understanding various…
In this study we show a way of achieving the reverse evolution of n-dimensional quantum walks by introducing interventions on the coin degree of freedom during the forward progression of the coin-walker system. Only a single intervention is…
Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…
We show that the coined quantum walk on a line can be understood as an interference phenomenon, can be classically implemented, and indeed already has been. The walk is essentially two independent walks associated with the different coin…
Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a…