Tweezer-programmable 2D quantum walks in a Hubbard-regime lattice
- URL: http://arxiv.org/abs/2202.01204v1
- Date: Wed, 2 Feb 2022 18:56:11 GMT
- Title: Tweezer-programmable 2D quantum walks in a Hubbard-regime lattice
- Authors: Aaron W. Young, William J. Eckner, Nathan Schine, Andrew M. Childs,
Adam M. Kaufman
- Abstract summary: We study continuous-time quantum walks of single atoms on a 2D square lattice.
We perform proof-of-principle demonstrations of spatial search using these walks.
When scaled to more particles, the capabilities demonstrated here can be extended to study a variety of problems in quantum information science.
- Score: 1.286202369590401
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum walks provide a framework for understanding and designing quantum
algorithms that is both intuitive and universal. To leverage the computational
power of these walks, it is important to be able to programmably modify the
graph a walker traverses while maintaining coherence. Here, we do this by
combining the fast, programmable control provided by optical tweezer arrays
with the scalable, homogeneous environment of an optical lattice. Using this
new combination of tools we study continuous-time quantum walks of single atoms
on a 2D square lattice, and perform proof-of-principle demonstrations of
spatial search using these walks. When scaled to more particles, the
capabilities demonstrated here can be extended to study a variety of problems
in quantum information science and quantum simulation, including the
deterministic assembly of ground and excited states in Hubbard models with
tunable interactions, and performing versions of spatial search in a larger
graph with increased connectivity, where search by quantum walk can be more
effective.
Related papers
- Complex-Phase Extensions of Szegedy Quantum Walk on Graphs [0.0]
This work introduces a graph-phased Szegedy's quantum walk, which incorporates link phases and local arbitrary phase rotations (APR)
We demonstrate how to adapt quantum circuits to these advancements, allowing phase patterns that ensure computational practicality.
Our findings illuminate the path towards more versatile and powerful quantum computing paradigms.
arXiv Detail & Related papers (2024-10-29T12:57:31Z) - Weaving Complex Graph on simple low-dimensional qubit lattices [3.861715730686731]
This paper presents two approaches to constructing complex quantum networks from simple qubit arrays.
The first approach utilizes a subset of qubits as tunable couplers, effectively yielding a range of non-trivial graph-based Hamiltonians.
The second approach employs dynamic graph engineering by periodically activating and deactivating couplers, enabling the creation of effective quantum walks.
arXiv Detail & Related papers (2024-05-25T05:37:42Z) - Quantum Walks on Simplicial Complexes and Harmonic Homology: Application to Topological Data Analysis with Superpolynomial Speedups [9.538251541300028]
We introduce a novel quantum walk that encodes the Laplacian, a key mathematical object whose spectral properties reflect the underlying simplicial complex.
Our results achieve superpolynomial quantum speedup with quantum walks without relying on quantum oracles for large datasets.
arXiv Detail & Related papers (2024-04-23T18:00:17Z) - Demonstration of multi-qubit entanglement and algorithms on a
programmable neutral atom quantum computer [0.0]
Neutral atom hyperfine qubits provide inherent scalability due to their identical characteristics, long coherence times, and ability to be trapped in dense multi-dimensional arrays.
We demonstrate several quantum algorithms on a programmable gate model neutral atom quantum computer in an architecture based on individual addressing of single atoms with tightly focused optical beams scanned across a two-dimensional array of qubits.
arXiv Detail & Related papers (2021-12-29T15:02:43Z) - On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
We devise three effective QAE-based learning protocols to address three classically computational hard learning problems.
Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
arXiv Detail & Related papers (2021-06-29T14:01:40Z) - Probing quantum information propagation with out-of-time-ordered
correlators [41.12790913835594]
Small-scale quantum information processors hold the promise to efficiently emulate many-body quantum systems.
Here, we demonstrate the measurement of out-of-time-ordered correlators (OTOCs)
A central requirement for our experiments is the ability to coherently reverse time evolution.
arXiv Detail & Related papers (2021-02-23T15:29:08Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - Entanglement transfer, accumulation and retrieval via quantum-walk-based
qubit-qudit dynamics [50.591267188664666]
Generation and control of quantum correlations in high-dimensional systems is a major challenge in the present landscape of quantum technologies.
We propose a protocol that is able to attain entangled states of $d$-dimensional systems through a quantum-walk-based it transfer & accumulate mechanism.
In particular, we illustrate a possible photonic implementation where the information is encoded in the orbital angular momentum and polarization degrees of freedom of single photons.
arXiv Detail & Related papers (2020-10-14T14:33:34Z) - Experimental Quantum Generative Adversarial Networks for Image
Generation [93.06926114985761]
We experimentally achieve the learning and generation of real-world hand-written digit images on a superconducting quantum processor.
Our work provides guidance for developing advanced quantum generative models on near-term quantum devices.
arXiv Detail & Related papers (2020-10-13T06:57:17Z) - Exploring complex graphs using three-dimensional quantum walks of
correlated photons [52.77024349608834]
We introduce a new paradigm for the direct experimental realization of excitation dynamics associated with three-dimensional networks.
This novel testbed for the experimental exploration of multi-particle quantum walks on complex, highly connected graphs paves the way towards exploiting the applicative potential of fermionic dynamics in integrated quantum photonics.
arXiv Detail & Related papers (2020-07-10T09:15:44Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.