Related papers: Generating Haar-uniform Randomness using Stochasti…
Efficient methods for generating pseudo-randomly distributed unitary operators are needed for the practical application of Haar distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical…
We study the sampling complexity of a probability distribution associated with an ensemble ofidentical noninteracting bosons undergoing a quantum random walk on a one-dimensional lattice.With uniform nearest-neighbor hopping we show that…
The concept of randomness in quantum computing has been central to construct benchmarking tools, cryptographic protocols, as well as a proof of beyond classical computation. Discerning whether quantum states (or unitaries) are randomly…
Quantum walks, in virtue of the coherent superposition and quantum interference, possess exponential superiority over its classical counterpart in applications of quantum searching and quantum simulation. The quantum enhanced power is…
With photonics, the quantum computational advantage has been demonstrated on the task of boson sampling. Next, developing quantum-enhanced approaches for practical problems becomes one of the top priorities for photonic systems. Quantum…
Randomness generation through quantum-chaotic evolution underpins foundational questions in statistical mechanics and applications across quantum information science, including benchmarking, tomography, metrology, and demonstrations of…
We put forward a new, versatile and highly-scalable experimental setup for the realization of discrete two-dimensional quantum random walks with a single-qubit coin and tunable degree of decoherence. The proposed scheme makes use of a small…
Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any…
In a recently demonstrated quantum-state tomography scheme [Phys. Rev. Lett. 124, 010405 (2020)], a random control field is locally applied to a multipartite system to reconstruct the full quantum state of the system through…
Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we…
Random numbers are at the heart of diverse fields, ranging from simulations of stochastic processes to classical and quantum cryptography. The requirement for true randomness in these applications has motivated various proposals for…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
The staggered quantum walk is a type of discrete-time quantum walk model without a coin which can be generated on a graph using particular partitions of the graph nodes. We design Hamiltonians for potential realization of the staggered…
With the increasing crossover between quantum information and machine learning, quantum simulation of neural networks has drawn unprecedentedly strong attention, especially for the simulation of associative memory in Hopfield neural…
The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk, which allows for incoherent…
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently…
We present a scheme for multi-bit quantum random number generation using a single qubit discrete-time quantum walk in one-dimensional space. Irrespective of the initial state of the qubit, quantum interference and entanglement of particle…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
Quantum walks are powerful tools not only to construct the quantum speedup algorithms but also to describe specific models in physical processes. Furthermore, the discrete time quantum walk has been experimentally realized in various…
Randomness is an essential tool in many disciplines of modern sciences, such as cryptography, black hole physics, random matrix theory and Monte Carlo sampling. In quantum systems, random operations can be obtained via random circuits…