Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1805.01858 · New Journal of Physics

Quantum computational supremacy in the sampling of bosonic random walkers on a one-dimensional lattice

Gopikrishnan Muraleedharan, Akimasa Miyake, Ivan Deutsch

Published Feb 11, 2019• 27 citations
arXivHTMLPDF

Abstract

Abstract We study the sampling complexity of a probability distribution associated with an ensemble of identical noninteracting bosons undergoing a quantum random walk on a one-dimensional lattice. With uniform nearest-neighbor hopping we show that one can efficiently sample the distribution for times logarithmic in the size of the system, while for longer times there is no known efficient sampling algorithm. With time-dependent hopping and optimal control, we design the time evolution to approximate an arbitrary Haar-random unitary map analogous to that designed for photons in a linear optical network. This approach highlights a route to generating quantum complexity by optimal control only of a single-body unitary matrix. We study this in the context of two potential experimental realizations: a spinor optical lattice of ultracold atoms and a quantum gas microscope.

DOI
10.1088/1367-2630/ab0610

Related papers

Boson-Sampling in the light of sample complexity

Christian Gogolin, Martin Kliesch, Leandro Aolita +1 more

Boson-Sampling is a classically computationally hard problem that can - in principle - be efficiently solved with quantum linear optical networks. Very recently, a rush of experimental activity has ignited with the aim of developing such devices as feasible instances of quantum simulators. Even approximate Boson-Sampling is believed to be hard with high probability if the unitary describing the optical network is drawn from the Haar measure. In this work we show that in this setup, with probability exponentially close to one in the number of bosons, no symmetric algorithm can distinguish the Boson-Sampling distribution from the uniform one from fewer than exponentially many samples. This means that the two distributions are operationally indistinguishable without detailed a priori knowledge. We carefully discuss the prospects of efficiently using knowledge about the implemented unitary for devising non-symmetric algorithms that could potentially improve upon this. We conclude that due to the very fact that Boson-Sampling is believed to be hard, efficient classical certification of Boson-Sampling devices seems to be out of reach.

arXiv:1306.3995•Jun 17, 2013•40 citations

Sampling complexity of Bosonic random walkers on a one-dimensional lattice

Gopikrishnan Muraleedharan, Akimasa Miyake, Ivan Deutsch

Computers based quantum logic are believed to solve problems faster and more efficiently than computers based on classical boolean logic. However, a large-scale universal quantum computer with error correction may not be realized in near future. But we can ask the question: can we devise a specific problem that a quantum device can solve faster than current state of the art super computers? One such problem is the so called "Boson Sampling" problem introduced by Aaronson and Arkhipov. The problem is to generate random numbers according to same distribution as the output number configurations of photons in linear optics. It was shown that this is a very hard task for classical computers, but can be realized using quantum devices. However, realizing this in photonic systems is proving to be harder than ever because of various challenges in preparation and measurements. We propose and analyze an alternate platform to implement this problem, ultra-cold atoms trapped in one-dimensional optical lattices.

•Jan 1, 2018•0 citations

Characterizing the Relationship Between Unitary Quantum Walks and Non-Homogeneous Random Walks

Matheus Guedes de Andrade, Franklin de Lima Marquezino, Daniel R. Figueiredo

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 relationship between quantum and random walks has been recently discussed in specific scenarios, this work establishes a formal equivalence between the two processes on arbitrary finite graphs and general conditions for shift and coin operators. It requires empowering random walks with time heterogeneity, where the transition probability of the walker is non-uniform and time dependent. The equivalence is obtained by equating the probability of measuring the quantum walk on a given node of the graph and the probability that the random walk is at that same node, for all nodes and time steps. The first result establishes procedure for a stochastic matrix sequence to induce a random walk that yields the exact same vertex probability distribution sequence of any given quantum walk, including the scenario with multiple interfering walkers. The second result establishes a similar procedure in the opposite direction. Given any random walk, a time-dependent quantum walk with the exact same vertex probability distribution is constructed. Interestingly, the matrices constructed by the first procedure allows for a different simulation approach for quantum walks where node samples respect neighbor locality and convergence is guaranteed by the law of large numbers, enabling efficient (polynomial-time) sampling of quantum graph trajectories. Furthermore, the complexity of constructing this sequence of matrices is discussed in the general case.

•Jun 29, 2021•0 citations

Generating Haar-Uniform Randomness Using Stochastic Quantum Walks on a Photonic Chip

Hao Long Tang, Leonardo Banchi, Tian-Yu Wang +9 more

As random operations for quantum systems are intensively used in various quantum information tasks, a trustworthy measure of the randomness in quantum operations is highly demanded. The Haar measure of randomness is a useful tool with wide applications, such as boson sampling. Recently, a theoretical protocol was proposed to combine quantum control theory and driven stochastic quantum walks to generate Haar-uniform random operations. This opens up a promising route to converting classical randomness to quantum randomness. Here, we implement a two-dimensional stochastic quantum walk on the integrated photonic chip and demonstrate that the average of all distribution profiles converges to the even distribution when the evolution length increases, suggesting the 1-pad Haar-uniform randomness. We further show that our two-dimensional array outperforms the one-dimensional array of the same number of waveguide for the speed of convergence. Our Letter demonstrates a scalable and robust way to generate Haar-uniform randomness that can provide useful building blocks to boost future quantum information techniques.

arXiv:2112.06549•Physical Review Letters•Feb 3, 2022•30 citations

An atomic boson sampler

Aaron W. Young, Shawn Geller, William J. Eckner +4 more

Abstract A boson sampler implements a restricted model of quantum computing. It is defined by the ability to sample from the distribution resulting from the interference of identical bosons propagating ac- cording to programmable, non-interacting dynamics [1]. Here, we demonstrate a new combination of tools for implementing boson sampling using ultracold atoms in a two-dimensional, tunnel-coupled optical lattice. These tools include fast and programmable preparation of large ensembles of nearly identical bosonic atoms (99.5+0.5 −1.6% indistinguishability) by means of rearrangement with optical tweezers and high-fidelity optical cooling, propagation for variable evolution time in the lattice with low loss (5.0(2) %, independent of evolution time), and high fidelity detection of the atom positions after their evolution (typically 99.8(1) %). With this system, we study specific instances of boson sampling involving up to 180 atoms distributed among ∼ 1000 sites in the lattice. Direct verifi- cation of a given boson sampling distribution is not feasible in this regime. Instead, we introduce and perform targeted tests to determine the indistinguishability of the prepared atoms, to char- acterize the applied family of single particle unitaries, and to observe expected bunching features due to interference for a large range of atom numbers. When extended to interacting systems, our work demonstrates the core capabilities required to directly assemble ground and excited states in simulations of various Hubbard models [2, 3].

arXiv:2307.06936•Nature•May 8, 2024•40 citations

Quantum logic using correlated one-dimensional quantum walks

Yoav Lahini, Gregory R. Steinbrecher, Adam D. Bookatz +1 more

Abstract Quantum Walks are unitary processes describing the evolution of an initially localized wavefunction on a lattice potential. The complexity of the dynamics increases significantly when several indistinguishable quantum walkers propagate on the same lattice simultaneously, as these develop non-trivial spatial correlations that depend on the particle’s quantum statistics, mutual interactions, initial positions, and the lattice potential. We show that even in the simplest case of a quantum walk on a one dimensional graph, these correlations can be shaped to yield a complete set of compact quantum logic operations. We provide detailed recipes for implementing quantum logic on one-dimensional quantum walks in two general cases. For non-interacting bosons—such as photons in waveguide lattices—we find high-fidelity probabilistic quantum gates that could be integrated into linear optics quantum computation schemes. For interacting quantum-walkers on a one-dimensional lattice—a situation that has recently been demonstrated using ultra-cold atoms—we find deterministic logic operations that are universal for quantum information processing. The suggested implementation requires minimal resources and a level of control that is within reach using recently demonstrated techniques. Further work is required to address error-correction.

npj Quantum Information•Jan 5, 2018•46 citations
Abstract We study the sampling complexity of a probability distribution associated with an ensemble of identical noninteracting bosons undergoing a quantum random walk on a one-dimensional lattice. With uniform nearest-neighbor hopping we show that one can efficiently sample the distribution for times logarithmic in the size of the system, while for longer times there is no known efficient sampling algorithm. With time-dependent hopping and optimal control, we design the time evolution to approximate an arbitrary Haar-random unitary map analogous to that designed for photons in a linear optical network. This approach highlights a route to generating quantum complexity by optimal control only of a single-body unitary matrix. We study this in the context of two potential experimental realizations: a spinor optical lattice of ultracold atoms and a quantum gas microscope.
Boson-Sampling is a classically computationally hard problem that can - in principle - be efficiently solved with quantum linear optical networks. Very recently, a rush of experimental activity has ignited with the aim of developing such devices as feasible instances of quantum simulators. Even approximate Boson-Sampling is believed to be hard with high probability if the unitary describing the optical network is drawn from the Haar measure. In this work we show that in this setup, with probability exponentially close to one in the number of bosons, no symmetric algorithm can distinguish the Boson-Sampling distribution from the uniform one from fewer than exponentially many samples. This means that the two distributions are operationally indistinguishable without detailed a priori knowledge. We carefully discuss the prospects of efficiently using knowledge about the implemented unitary for devising non-symmetric algorithms that could potentially improve upon this. We conclude that due to the very fact that Boson-Sampling is believed to be hard, efficient classical certification of Boson-Sampling devices seems to be out of reach.
Computers based quantum logic are believed to solve problems faster and more efficiently than computers based on classical boolean logic. However, a large-scale universal quantum computer with error correction may not be realized in near future. But we can ask the question: can we devise a specific problem that a quantum device can solve faster than current state of the art super computers? One such problem is the so called "Boson Sampling" problem introduced by Aaronson and Arkhipov. The problem is to generate random numbers according to same distribution as the output number configurations of photons in linear optics. It was shown that this is a very hard task for classical computers, but can be realized using quantum devices. However, realizing this in photonic systems is proving to be harder than ever because of various challenges in preparation and measurements. We propose and analyze an alternate platform to implement this problem, ultra-cold atoms trapped in one-dimensional optical lattices.
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 relationship between quantum and random walks has been recently discussed in specific scenarios, this work establishes a formal equivalence between the two processes on arbitrary finite graphs and general conditions for shift and coin operators. It requires empowering random walks with time heterogeneity, where the transition probability of the walker is non-uniform and time dependent. The equivalence is obtained by equating the probability of measuring the quantum walk on a given node of the graph and the probability that the random walk is at that same node, for all nodes and time steps. The first result establishes procedure for a stochastic matrix sequence to induce a random walk that yields the exact same vertex probability distribution sequence of any given quantum walk, including the scenario with multiple interfering walkers. The second result establishes a similar procedure in the opposite direction. Given any random walk, a time-dependent quantum walk with the exact same vertex probability distribution is constructed. Interestingly, the matrices constructed by the first procedure allows for a different simulation approach for quantum walks where node samples respect neighbor locality and convergence is guaranteed by the law of large numbers, enabling efficient (polynomial-time) sampling of quantum graph trajectories. Furthermore, the complexity of constructing this sequence of matrices is discussed in the general case.
As random operations for quantum systems are intensively used in various quantum information tasks, a trustworthy measure of the randomness in quantum operations is highly demanded. The Haar measure of randomness is a useful tool with wide applications, such as boson sampling. Recently, a theoretical protocol was proposed to combine quantum control theory and driven stochastic quantum walks to generate Haar-uniform random operations. This opens up a promising route to converting classical randomness to quantum randomness. Here, we implement a two-dimensional stochastic quantum walk on the integrated photonic chip and demonstrate that the average of all distribution profiles converges to the even distribution when the evolution length increases, suggesting the 1-pad Haar-uniform randomness. We further show that our two-dimensional array outperforms the one-dimensional array of the same number of waveguide for the speed of convergence. Our Letter demonstrates a scalable and robust way to generate Haar-uniform randomness that can provide useful building blocks to boost future quantum information techniques.
Abstract A boson sampler implements a restricted model of quantum computing. It is defined by the ability to sample from the distribution resulting from the interference of identical bosons propagating ac- cording to programmable, non-interacting dynamics [1]. Here, we demonstrate a new combination of tools for implementing boson sampling using ultracold atoms in a two-dimensional, tunnel-coupled optical lattice. These tools include fast and programmable preparation of large ensembles of nearly identical bosonic atoms (99.5+0.5 −1.6% indistinguishability) by means of rearrangement with optical tweezers and high-fidelity optical cooling, propagation for variable evolution time in the lattice with low loss (5.0(2) %, independent of evolution time), and high fidelity detection of the atom positions after their evolution (typically 99.8(1) %). With this system, we study specific instances of boson sampling involving up to 180 atoms distributed among ∼ 1000 sites in the lattice. Direct verifi- cation of a given boson sampling distribution is not feasible in this regime. Instead, we introduce and perform targeted tests to determine the indistinguishability of the prepared atoms, to char- acterize the applied family of single particle unitaries, and to observe expected bunching features due to interference for a large range of atom numbers. When extended to interacting systems, our work demonstrates the core capabilities required to directly assemble ground and excited states in simulations of various Hubbard models [2, 3].
Abstract Quantum Walks are unitary processes describing the evolution of an initially localized wavefunction on a lattice potential. The complexity of the dynamics increases significantly when several indistinguishable quantum walkers propagate on the same lattice simultaneously, as these develop non-trivial spatial correlations that depend on the particle’s quantum statistics, mutual interactions, initial positions, and the lattice potential. We show that even in the simplest case of a quantum walk on a one dimensional graph, these correlations can be shaped to yield a complete set of compact quantum logic operations. We provide detailed recipes for implementing quantum logic on one-dimensional quantum walks in two general cases. For non-interacting bosons—such as photons in waveguide lattices—we find high-fidelity probabilistic quantum gates that could be integrated into linear optics quantum computation schemes. For interacting quantum-walkers on a one-dimensional lattice—a situation that has recently been demonstrated using ultra-cold atoms—we find deterministic logic operations that are universal for quantum information processing. The suggested implementation requires minimal resources and a level of control that is within reach using recently demonstrated techniques. Further work is required to address error-correction.