The Simplest 2D Quantum Walk Detects Chaoticity

  • Abstract
  • References
  • Similar Papers
Abstract
Translate article icon Translate Article Star icon
Take notes icon Take Notes

Quantum walks are, at present, an active field of study in mathematics, with important applications in quantum information and statistical physics. In this paper, we determine the influence of basic chaotic features on the walker behavior. For this purpose, we consider an extremely simple model consisting of alternating one-dimensional walks along the two spatial coordinates in bidimensional closed domains (hard wall billiards). The chaotic or regular behavior induced by the boundary shape in the deterministic classical motion translates into chaotic signatures for the quantized problem, resulting in sharp differences in the spectral statistics and morphology of the eigenfunctions of the quantum walker. Indeed, we found, for the Bunimovich stadium—a chaotic billiard—level statistics described by a Brody distribution with parameter δ≃0.1. This indicates a weak level repulsion, and also enhanced eigenfunction localization, with an average participation ratio (PR)≃1150 compared to the rectangular billiard (regular) case, where the average PR≃1500. Furthermore, scarring on unstable periodic orbits is observed. The fact that our simple model exhibits such key signatures of quantum chaos, e.g., non-Poissonian level statistics and scarring, that are sensitive to the underlying classical dynamics in the free particle billiard system is utterly surprising, especially when taking into account that quantum walks are diffusive models, which are not direct quantizations of a Hamiltonian.

ReferencesShowing 10 of 33 papers
  • Cite Count Icon 2446
  • 10.1103/physrevlett.52.1
Characterization of Chaotic Quantum Spectra and Universality of Level Fluctuation Laws
  • Jan 2, 1984
  • Physical Review Letters
  • O Bohigas + 2 more

  • Open Access Icon
  • Cite Count Icon 13
  • 10.1103/physreve.85.026214
Computationally efficient method to construct scar functions
  • Feb 24, 2012
  • Physical Review E
  • F Revuelta + 3 more

  • Open Access Icon
  • Cite Count Icon 15
  • 10.1038/srep25767
The defect-induced localization in many positions of the quantum random walk
  • May 24, 2016
  • Scientific Reports
  • Tian Chen + 1 more

  • Open Access Icon
  • 10.1038/s41598-025-94239-z
Hybrid deep learning CNN-LSTM model for forecasting direct normal irradiance: a study on solar potential in Ghardaia, Algeria
  • May 2, 2025
  • Scientific Reports
  • Boumediene Ladjal + 7 more

  • Open Access Icon
  • Cite Count Icon 2
  • 10.1364/josab.431752
Readout of quantum information spreading using a disordered quantum walk
  • Aug 16, 2021
  • Journal of the Optical Society of America B
  • Farzam Nosrati + 7 more

  • Open Access Icon
  • Cite Count Icon 391
  • 10.1126/science.1260364
Strongly correlated quantum walks in optical lattices
  • Mar 12, 2015
  • Science
  • Philipp M Preiss + 8 more

  • Open Access Icon
  • Cite Count Icon 18
  • 10.1088/0305-4470/35/38/301
Scar functions in the Bunimovich stadium billiard
  • Sep 10, 2002
  • Journal of Physics A: Mathematical and General
  • Gabriel G Carlo + 2 more

  • Cite Count Icon 1522
  • 10.1103/physreva.48.1687
Quantum random walks.
  • Aug 1, 1993
  • Physical Review A
  • Y Aharonov + 2 more

  • Open Access Icon
  • Cite Count Icon 159
  • 10.1145/992287.992296
Quantum search algorithms
  • Jun 1, 2004
  • ACM SIGACT News
  • A Ambainis

  • Open Access Icon
  • Cite Count Icon 15
  • 10.1088/1367-2630/16/3/035005
Lattice scars: surviving in an open discrete billiard
  • Mar 1, 2014
  • New Journal of Physics
  • Víctor Fernández-Hurtado + 3 more

Similar Papers
  • PDF Download Icon
  • Research Article
  • Cite Count Icon 7
  • 10.1103/physrevresearch.5.023150
Quantum walks on random lattices: Diffusion, localization, and the absence of parametric quantum speedup
  • Jun 5, 2023
  • Physical Review Research
  • Rostislav Duda + 4 more

Discrete-time quantum walks, quantum generalizations of classical random walks, provide a framework for quantum information processing, quantum algorithms and quantum simulation of condensed matter systems. The key property of quantum walks, which lies at the heart of their quantum information applications, is the possibility for a parametric quantum speed-up in propagation compared to classical random walks. In this work we study propagation of quantum walks on percolation-generated two-dimensional random lattices. In large-scale simulations of topological and trivial split-step walks, we identify distinct pre-diffusive and diffusive behaviors at different time scales. Importantly, we show that even arbitrarily weak concentrations of randomly removed lattice sites give rise to a complete breakdown of the superdiffusive quantum speed-up, reducing the motion to ordinary diffusion. By increasing the randomness, quantum walks eventually stop spreading due to Anderson localization. Near the localization threshold, we find that the quantum walks become subdiffusive. The fragility of quantum speed-up implies dramatic limitations for quantum information applications of quantum walks on random geometries and graphs.

  • Research Article
  • Cite Count Icon 2
  • 10.1007/s11128-016-1414-9
Localization of two-particle quantum walk on glued-tree and its application in generating Bell states
  • Aug 8, 2016
  • Quantum Information Processing
  • Huiquan Wang + 3 more

Studies on two-particle quantum walks show that the spatial interaction between walkers will dynamically generate complex entanglement. However, those entanglement states are usually on a large state space and their evolutions are complex. It makes the entanglement states generated by quantum walk difficult to be applied directly in many applications of quantum information, such as quantum teleportation and quantum cryptography. In this paper, we firstly analyse a localization phenomena of two-particle quantum walk and then introduce how to use it to generate a Bell state. We will show that one special superposition component of the walkers' state is localized on the root vertex if a certain interaction exists between walkers. This localization is interesting because it is contrary to our knowledge that quantum walk spreads faster than its classical counterpart. More interestingly, the localized component is a Bell state in the coin space of two walkers. By this method, we can obtain a Bell state easily from the quantum walk with spatial interaction by a local measurement, which is required in many applications. Through simulations, we verify that this method is able to generate the Bell state $$\frac{1}{\sqrt{2}}(|A \rangle _1|A\rangle _2 \pm |B\rangle _1|B\rangle _2)$$12(|Aź1|Aź2±|Bź1|Bź2) in the coin space of two walkers with fidelity greater than $$99.99999\,\%$$99.99999% in theory, and we have at least a $$50\,\%$$50% probability to obtain the expected Bell state after a proper local measurement.

  • Conference Article
  • 10.1109/cleoe-eqec.2017.8087814
Floqeut topological phases in PT symmetric quantum walks with gain and loss
  • Jun 1, 2017
  • Hideaki Obuse + 3 more

A quantum walk, that is, a synthetic quantum system mainly impremented by photonic systems, whose dynamics is described by a time-evolution operator, provides potential applications for quantum computing and information. It is further interesting that the quantum walk possesses novel topological phases akin to those of Floquet topological insulators, which are topological insulators driven by a time-periodic field[1,2]. Recently, a one-dimensional quantum walk dynamics associated with gain and loss is experimentally implemented by optical fiber loops [3]. The experiment shows that the energy of the system is kept to be real as a manifestation of PT symmetry (combined parity and time-reversal symmetry) in spite of the open quantum system.

  • Research Article
  • Cite Count Icon 7
  • 10.1103/physrevlett.125.160502
Integrated Quantum-Walk Structure and NAND Tree on a Photonic Chip.
  • Oct 14, 2020
  • Physical Review Letters
  • Yao Wang + 7 more

In the age of the post-Moore era, the next-generation computing model would be a hybrid architecture consisting of different physical components, such as photonic chips. In 2008, it was proposed that the solving of the NAND-tree problem can be sped up by quantum walk. This scheme is groundbreaking due to the universality of the NAND gate. However, experimental demonstration has not been achieved so far, mostly due to the challenge in preparing the propagating initial state. Here we propose an alternative solution by including a structure called a "quantum slide," where a propagating Gaussian wave packet can be generated deterministically along a properly engineered chain. In our experimental demonstration, the optical NAND tree is capable of solving computational problems with a total of four input bits, based on the femtosecond laser 3D direct-writing technique on a photonic chip. These results remove one main roadblock to photonic NAND-tree computation, and the construction of a quantum slide may find other interesting applications in quantum information and quantum optics.

  • Research Article
  • Cite Count Icon 3
  • 10.1142/s0219493722500010
Higher-dimensional open quantum walk in environment of quantum Bernoulli noises
  • Jul 3, 2021
  • Stochastics and Dynamics
  • Ce Wang

Open quantum walks (OQWs) (also known as open quantum random walks) are quantum analogs of classical Markov chains in probability theory, and have potential application in quantum information and quantum computation. Quantum Bernoulli noises (QBNs) are annihilation and creation operators acting on Bernoulli functionals, and can be used as the environment of an open quantum system. In this paper, by using QBNs as the environment, we introduce an OQW on a general higher-dimensional integer lattice. We obtain a quantum channel representation of the walk, which shows that the walk is indeed an OQW. We prove that all the states of the walk are separable provided its initial state is separable. We also prove that, for some initial states, the walk has a limit probability distribution of higher-dimensional Gauss type. Finally, we show links between the walk and a unitary quantum walk recently introduced in terms of QBNs.

  • Research Article
  • Cite Count Icon 18
  • 10.1080/03081080701535898
Relative C -numerical ranges for applications in quantum control and quantum information
  • Feb 3, 2007
  • Linear and Multilinear Algebra
  • G Dirr + 3 more

Motivated by applications in quantum information and quantum control, a new type of C-numerical range, the relative C-numerical range denoted as WK (C, A), is introduced. It arises upon replacing the unitary group U(N) in the definition of the classical C-numerical range by any of its compact and connected subgroups K ⊂ U(N). The geometric properties of the relative C-numerical range are analyzed in detail. Counterexamples prove that its geometry is more intricate than in the classical case: e.g., W K (C, A) is neither star-shaped nor simply connected. Yet, a well-known result on the rotational symmetry of the classical C-numerical range extends to WK (C, A), as shown by a new approach based on Lie theory. Furthermore, we concentrate on the subgroup , i.e., the n-fold tensor product of SU(2), which is of particular interest in applications. In this case, sufficient conditions are derived for WK (C, A) being a circular disc centered at the origin of the complex plane. Finally, the previous results are illustrated in detail for SU(2) ⊗ SU(2).

  • Research Article
  • Cite Count Icon 9
  • 10.1016/j.biosystems.2020.104340
Protein-DNA target search relies on quantum walk
  • Dec 31, 2020
  • Biosystems
  • Mario D'Acunto

Protein-DNA target search relies on quantum walk

  • Research Article
  • Cite Count Icon 4
  • 10.1088/1464-4266/7/7/005
Semiconductor sources of twin photons for quantum information
  • Jun 30, 2005
  • Journal of Optics B: Quantum and Semiclassical Optics
  • S Ducci + 6 more

A large number of scientific proposals made in the last few years are based on transport and manipulation of information using single quantum objects. Some of them make use of entanglement in pairs of particles such as twin photons. Although theoretical proposals have demonstrated highly interesting perspectives in the quantum information domain, experimental realizations and applications still suffer from the complexity of experimental set-ups and technological limitations. This paper presents various approaches aiming at efficient twin photon semiconductor sources. The emergence of these compact and integrated devices would be an important technological breakthrough in quantum information applications.

  • Research Article
  • 10.1002/qute.202500355
Low‐Loss Polarization‐Maintaining Router for Single and Entangled Photons at a Telecom Wavelength
  • Sep 2, 2025
  • Advanced Quantum Technologies
  • Pengfei Wang + 5 more

Photon polarization serves as an essential quantum information carrier in quantum information and measurement applications. Routing of arbitrarily polarized single photons and polarization‐entangled photons is a crucial technology for scaling up quantum information applications. Here, a low‐loss, noiseless, polarization‐maintaining routing of arbitrarily polarized single photons and, crucially, multi‐photon entangled states is demonstrated where the entanglement is encoded in orthogonal polarization bases, at the telecom L‐band. The interferometer‐based router is constructed by optics with a low angle of incidence and cross‐aligned electro‐optic crystals, achieving the polarization‐maintaining operation with a minimal number of optical components. The routing of arbitrarily‐polarized heralded single photons with a 0.057 dB (1.3%) loss, a 22 dB switching extinction ratio, and 99% polarization process fidelity to ideal identity operation is demonstrated. Moreover, the high‐quality router achieves the routing of two‐photon N00N‐type entangled states with a highly maintained interference visibility of 97%. The demonstrated router scheme preserving multi‐photon polarization state paves the way toward polarization‐encoded photonic quantum network as well as multi‐photon entanglement synthesis via spatial‐ and time‐multiplexing techniques.

  • Research Article
  • Cite Count Icon 1
  • 10.1007/s11128-012-0450-3
Special issue on quantum walks
  • Jul 15, 2012
  • Quantum Information Processing
  • Yutaka Shikano

Understanding quantum dynamical features seems to be needed to open the next step of quantum information science. One strong candidate to understand quantum dynamical phenomena is a quantumwalk. Quantumwalks are defined as the quantummechanical analogue of the classical random walk. However, those are not the quantization of the classical random walks. Like the classical random walks, there may be many applications of the quantum walks. Therefore, the community of the quantum walk is an interdisciplinary field from mathematics to the experimental physics. The quantum walks have two types; the discrete-time and the continuous-time quantum walks. Both common and unique features are the followings; (i) the ballistic transport system, which corresponds to quantum transportation and (ii) non-normal probability distribution under the uniform system, and (iii) the Anderson-like localization. By combining these features, quantum walks show an intriguing phenomena in mathematics, physics, and computer science. The community of quantum walks is gradually increased. They held some workshops, e.g., at Tokyo Institute of Technology, Tokyo, Japan in 2011 (cancellation due to the Japan big earthquakes and aftermath) and at Instituto de Fisica Corpuscular, Valencia, Spain in 2011. A workshop will be held at the Institute for Molecular Science, Okazaki, Japan on November, 2012 to collect the quantum walkers. Many scientists have a potential to study the quantum walks. The aim of this special issue is to know what is the role of quantum walks for the other potentially related fields and to reveal many varieties of unique aspects and open problems on the quantum walks. Therefore, we have prepared three comprehensive reviews from mathematics, theoretical physics, and quantum information, and seven contributed articles from theoretical viewpoints. I hope that the quantum walks

  • Research Article
  • Cite Count Icon 2
  • 10.1063/5.0174472
Simulation of quantum walks on a circle with polar molecules via optimal control.
  • Nov 27, 2023
  • The Journal of Chemical Physics
  • Yi-Kai Ding + 2 more

Quantum walks are the quantum counterpart of classical random walks and have various applications in quantum information science. Polar molecules have rich internal energy structure and long coherence time and thus are considered as a promising candidate for quantum information processing. In this paper, we propose a theoretical scheme for implementing discrete-time quantum walks on a circle with dipole-dipole coupled SrO molecules. The states of the walker and the coin are encoded in the pendular states of polar molecules induced by an external electric field. We design the optimal microwave pulses for implementing quantum walks on a four-node circle and a three-node circle by multi-target optimal control theory. To reduce the accumulation of decoherence and improve the fidelity, we successfully realize a step of quantum walk with only one optimal pulse. Moreover, we also encode the walker into a three-level molecular qutrit and a four-level molecular ququart and design the corresponding optimal pulses for quantum walks, which can reduce the number of molecules used. It is found that all the quantum walks on a circle in our scheme can be achieved via optimal control fields with high fidelities. Our results could shed some light on the implementation of discrete-time quantum walks and high-dimensional quantum information processing with polar molecules.

  • Research Article
  • Cite Count Icon 60
  • 10.1103/physreva.75.052310
Demonstration of one-dimensional quantum random walks using orbital angular momentum of photons
  • May 9, 2007
  • Physical Review A
  • Pei Zhang + 5 more

Quantum random walks have attracted special interest because they could lead to new quantum algorithms. Photons can carry orbital angular momentum (OAM) thereby offering a practical realization of a high-dimensional quantum information carrier. By employing OAM of photons, we experimentally realized the one-dimensional discrete-time quantum random walk. Three steps of a one-dimensional quantum random walk were implemented in our protocol showing the obvious difference between quantum and classical random walks.

  • Conference Article
  • Cite Count Icon 3
  • 10.1063/1.5025463
Fermionic entanglement via quantum walks in quantum dots
  • Jan 1, 2018
  • Alexey A Melnikov + 1 more

Quantum walks are fundamentally different from random walks due to the quantum superposition property of quantum objects. Quantum walk process was found to be very useful for quantum information and quantum computation applications. In this paper we demonstrate how to use quantum walks as a tool to generate high-dimensional two-particle fermionic entanglement. The generated entanglement can survive longer in the presence of depolorazing noise due to the periodicity of quantum walk dynamics. The possibility to create two distinguishable qudits in a system of tunnel-coupled semiconductor quantum dots is discussed.

  • Research Article
  • Cite Count Icon 1
  • 10.1088/1674-1056/ab44ae
Experimental implementation of a continuous-time quantum random walk on a solid-state quantum information processor**Project supported by the National Key Research and Development Program of China (Grant Nos. 2018YFA0306600 and 2016YFB0501603), the National Natural Science Foundation of China (Grant No. 11761131011), the Fund from the Chinese Academy of Sciences (Grant Nos. GJJSTD20170001, QYZDYSSWSLH004, and QYZDB-SSW-SLH005), the Anhui Initiative Fund in Quantum
  • Oct 30, 2019
  • Chinese Physics B
  • Maimaitiyiming Tusun + 4 more

There are some problems that quantum computers seem to be exponentially faster than classical computers, like factoring large numbers, machine learning, and simulation of quantum systems. Constructing an appropriate quantum algorithm becomes more important for solving these specific problems. In principle, any quantum algorithm can recast by a quantum random walk algorithm. Although quantum random walk with a few qubits has been implemented in a variety of systems, the experimental demonstration of solid-state quantum random walk remains elusive. Here we report the experimental implementation of the quantum continuous-time random walk algorithm by a two-qubit quantum processor in a nitrogen–vacancy center in diamond. We found that quantum random walk on a circle does not converge to any stationary distribution and exhibit a reversible property. Our results represent a further investigation of quantum walking dynamics in solid spin platforms, may also lead to other practical applications by the use of quantum continuous-time random walk for quantum algorithm design and quantum coherence transport.

  • Conference Article
  • Cite Count Icon 1
  • 10.1117/12.2656160
Quantum steering and its applications in quantum information
  • Dec 31, 2022
  • Qiongyi He

The concept of quantum steering was originally introduced by Schrödinger to describe the "spooky action-at-a-distance" effect noted in the Einstein-Podolsky-Rosen (EPR) paradox, whereby local measurements performed on one party apparently adjust (steer) the state of another distant party. In this talk, I will give an introduction about the advances of the EPR steering and its advantage as quantum resource. Then I will present our efforts on characterizing bipartite and multipartite steering and developing its unique applications in quantum information processing. I will give an overview of our recent developments on quantum steering and its applications in quantum information. I will share our view about the current challenges, opportunities and the future directions for this topic.

More from: Mathematics
  • New
  • Research Article
  • 10.3390/math13213558
Dynamic Event-Triggered Adaptive Broad Learning for a Two-Degree-of-Freedom Helicopter System with Prescribed Performance
  • Nov 6, 2025
  • Mathematics
  • Liang Cao + 5 more

  • New
  • Research Article
  • 10.3390/math13213560
A New 5D Chaotic Supply Chain System with Transport Lag: Modeling, Bifurcation Analysis, Offset Boosting Control and Synchronization
  • Nov 6, 2025
  • Mathematics
  • Muhamad Deni Johansyah + 4 more

  • New
  • Research Article
  • 10.3390/math13213557
An Analysis of the Mechanism and Mode Evolution for Blockchain-Empowered Research Credit Supervision Based on Prospect Theory: A Case from China
  • Nov 6, 2025
  • Mathematics
  • Gang Li + 3 more

  • New
  • Research Article
  • 10.3390/math13213563
Certain Subclasses of Bi-Univalent Functions Involving Caputo Fractional Derivatives with Bounded Boundary Rotation
  • Nov 6, 2025
  • Mathematics
  • Abbas Kareem Wanas + 3 more

  • New
  • Research Article
  • 10.3390/math13213569
LEMSOFT: Leveraging Extraction Method and Soft Voting for Android Malware Detection
  • Nov 6, 2025
  • Mathematics
  • Qiang Han + 3 more

  • New
  • Research Article
  • 10.3390/math13213559
Cost Optimization in a GI/M/2/N Queue with Heterogeneous Servers, Working Vacations, and Impatient Customers via the Bat Algorithm
  • Nov 6, 2025
  • Mathematics
  • Abdelhak Guendouzi + 1 more

  • New
  • Research Article
  • 10.3390/math13213555
Analysis of a Markovian Queueing Model with an Alternating Server and Queue-Length-Based Threshold Control
  • Nov 6, 2025
  • Mathematics
  • Doo Il Choi + 1 more

  • New
  • Research Article
  • 10.3390/math13213562
Covariate-Adjusted Precision Matrix Estimation Under Lower Polynomial Moment Assumption
  • Nov 6, 2025
  • Mathematics
  • Shuwei Hu

  • New
  • Research Article
  • 10.3390/math13213556
Estimating Climate Risk Exposure in the U.S. Insurance Sector Using Factor Model and EVT
  • Nov 6, 2025
  • Mathematics
  • Olanrewaju Oluwadamilare Olaniyan

  • New
  • Research Article
  • 10.3390/math13213561
A New Hardy–Hilbert-Type Integral Inequality Involving General Homogeneous Kernel and Two Derivative Functions of Higher Order
  • Nov 6, 2025
  • Mathematics
  • Bicheng Yang + 2 more

Save Icon
Up Arrow
Open/Close
  • Ask R Discovery Star icon
  • Chat PDF Star icon

AI summaries and top papers from 250M+ research sources.

Search IconWhat is the difference between bacteria and viruses?
Open In New Tab Icon
Search IconWhat is the function of the immune system?
Open In New Tab Icon
Search IconCan diabetes be passed down from one generation to the next?
Open In New Tab Icon