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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Silicon photonic chips for search on improved-glued-binary-tree based on continuous-time quantum walk

Qi Fan, Qingyan Ma, Yufei Wang, Wanhua Zheng

Published Nov 3, 2016• 1 citation
Publisher

Abstract

Search on improved-glued-binary-trees is a representative example of quantum superiority, where exponential acceleration can be achieved using quantum walk with respect to any classical algorithms. Here we analyzed the evolution process of this quantum-walk-based algorithm. Several remarkable features of the process are revealed. Generation of the model by introducing tunable defect strength and double defects is also discussed and the effects of these generalization on evolution process, arrival probability and residual probability are discussed in details. Physical implementation with silicon ridge waveguide array is presented. The design of the array with FEM method are presented and light propagation simulation with FDTD method shows that this kind of structure is feasible for the task. Lastly, preliminary experimental demonstration with classical coherent light simulation are presented. Our results show that silicon photonic chips are suitable for such search problems and opening a route towards large-scale photonic quantum computation.

DOI
10.1117/12.2246263

Related papers

Optical simulations on silicon microstructure chips: quantum walk and its applications

Yufei Wang, Qi Fan, Qingyan Ma +2 more

We propose a photonic crystal self-collimation chip for experimentally simulating discrete-time quantum walk (QW), and also demonstrate simulation of second-order coupling Heisenberg equation and QW-based search on improved-glued-binary-tree on different silicon artificial microstructures.

Conference on Lasers and Electro-Optics•Jan 1, 2017•0 citations

Quantum fast hitting on glued trees mapped on a photonic chip

Zi-Yu Shi, Hao Long Tang, Zhen Feng +10 more

Quantum walks on graphs play an important role in the field of quantum algorithms. Fast hitting is one of the properties that quantum walk algorithms can utilize to outperform classical random walk algorithms. Fast hitting refers to a particle starting from the entrance node on a graph and trying to hit the exit node quickly. Especially, continuous-time quantum walks on random glued binary trees have been investigated in theories extensively for their exponentially faster hitting speed over classical random walks. Here, using heralded single photons to represent quantum walkers and laser-written waveguide arrays to simulate the theoretical graph, we are able to demonstrate the hitting efficiency of quantum walks with tree depth as high as 16 layers for the first time. Furthermore, we expand the graph’s branching rate from 2 to 5, revealing that quantum walks can exhibit more superiority over classical random walks as the branching rate increases. Our results may shed light on the physical implementation of quantum walk algorithms as well as quantum computation and quantum simulation.

arXiv:1907.12539•Optica•May 5, 2020•20 citations

Experimental two-dimensional quantum walk on a photonic chip

Hao Long Tang, Xiao-Feng Lin, Zhen Feng +10 more

Quantum walks, in virtue of the coherent superposition and quantum interference, have exponential superiority over their classical counterpart in applications of quantum searching and quantum simulation. The quantum-enhanced power is highly related to the state space of quantum walks, which can be expanded by enlarging the photon number and/or the dimensions of the evolution network, but the former is considerably challenging due to probabilistic generation of single photons and multiplicative loss. We demonstrate a two-dimensional continuous-time quantum walk by using the external geometry of photonic waveguide arrays, rather than the inner degree of freedoms of photons. Using femtosecond laser direct writing, we construct a large-scale three-dimensional structure that forms a two-dimensional lattice with up to 49 × 49 nodes on a photonic chip. We demonstrate spatial two-dimensional quantum walks using heralded single photons and single photon-level imaging. We analyze the quantum transport properties via observing the ballistic evolution pattern and the variance profile, which agree well with simulation results. We further reveal the transient nature that is the unique feature for quantum walks of beyond one dimension. An architecture that allows a quantum walk to freely evolve in all directions and at a large scale, combining with defect and disorder control, may bring up powerful and versatile quantum walk machines for classically intractable problems.

arXiv:1704.08242•Science Advances•May 4, 2018•264 citations

Large-scale full-programmable quantum walk and its applications

Yizhi Wang, Yingwen Liu, Junwei Zhan +22 more

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 walks are powerful kernels for developing new and useful quantum algorithms. Here we realize large-scale quantum walks using a fully programmable photonic quantum computing system. The system integrates a silicon quantum photonic chip, enabling the simulation of quantum walk dynamics on graphs with up to 400 vertices and possessing full programmability over quantum walk parameters, including the particle property, initial state, graph structure, and evolution time. In the 400-dimensional Hilbert space, the average fidelity of random entangled quantum states after the whole on-chip circuit evolution reaches as high as 94.29$\pm$1.28$\%$. With the system, we demonstrated exponentially faster hitting and quadratically faster mixing performance of quantum walks over classical random walks, achieving more than two orders of magnitude of enhancement in the experimental hitting efficiency and almost half of the reduction in the experimental evolution time for mixing. We utilize the system to implement a series of quantum applications, including measuring the centrality of scale-free networks, searching targets on Erdös-Rényi networks, distinguishing non-isomorphic graph pairs, and simulating the topological phase of higher-order topological insulators. Our work shows one feasible path for quantum photonics to address applications of practical interests in the near future.

arXiv:2208.13186•Aug 28, 2022•9 citations

Integrated Quantum-Walk Structure and NAND Tree on a Photonic Chip

Yao Wang, Zi-Wei Cui, Yong‐Heng Lu +5 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.

arXiv:2001.08755•Physical Review Letters•Oct 14, 2020•12 citations

Implementing graph-theoretic quantum algorithms on a silicon photonic quantum walk processor

Xiaogang Qiang, Yizhi Wang, Shichuan Xue +15 more

Applications of quantum walks can depend on the number, exchange symmetry and indistinguishability of the particles involved, and the underlying graph structures where they move. Here, we show that silicon photonics, by exploiting an entanglement-driven scheme, can realize quantum walks with full control over all these properties in one device. The device we realize implements entangled two-photon quantum walks on any five-vertex graph, with continuously tunable particle exchange symmetry and indistinguishability. We show how this simulates single-particle walks on larger graphs, with size and geometry controlled by tuning the properties of the composite quantum walkers. We apply the device to quantum walk algorithms for searching vertices in graphs and testing for graph isomorphisms. In doing so, we implement up to 100 sampled time steps of quantum walk evolution on each of 292 different graphs. This opens the way to large-scale, programmable quantum walk processors for classically intractable applications.

Science Advances•Feb 26, 2021•105 citations
Search on improved-glued-binary-trees is a representative example of quantum superiority, where exponential acceleration can be achieved using quantum walk with respect to any classical algorithms. Here we analyzed the evolution process of this quantum-walk-based algorithm. Several remarkable features of the process are revealed. Generation of the model by introducing tunable defect strength and double defects is also discussed and the effects of these generalization on evolution process, arrival probability and residual probability are discussed in details. Physical implementation with silicon ridge waveguide array is presented. The design of the array with FEM method are presented and light propagation simulation with FDTD method shows that this kind of structure is feasible for the task. Lastly, preliminary experimental demonstration with classical coherent light simulation are presented. Our results show that silicon photonic chips are suitable for such search problems and opening a route towards large-scale photonic quantum computation.
Quantum walks on graphs play an important role in the field of quantum algorithms. Fast hitting is one of the properties that quantum walk algorithms can utilize to outperform classical random walk algorithms. Fast hitting refers to a particle starting from the entrance node on a graph and trying to hit the exit node quickly. Especially, continuous-time quantum walks on random glued binary trees have been investigated in theories extensively for their exponentially faster hitting speed over classical random walks. Here, using heralded single photons to represent quantum walkers and laser-written waveguide arrays to simulate the theoretical graph, we are able to demonstrate the hitting efficiency of quantum walks with tree depth as high as 16 layers for the first time. Furthermore, we expand the graph’s branching rate from 2 to 5, revealing that quantum walks can exhibit more superiority over classical random walks as the branching rate increases. Our results may shed light on the physical implementation of quantum walk algorithms as well as quantum computation and quantum simulation.
Quantum walks, in virtue of the coherent superposition and quantum interference, have exponential superiority over their classical counterpart in applications of quantum searching and quantum simulation. The quantum-enhanced power is highly related to the state space of quantum walks, which can be expanded by enlarging the photon number and/or the dimensions of the evolution network, but the former is considerably challenging due to probabilistic generation of single photons and multiplicative loss. We demonstrate a two-dimensional continuous-time quantum walk by using the external geometry of photonic waveguide arrays, rather than the inner degree of freedoms of photons. Using femtosecond laser direct writing, we construct a large-scale three-dimensional structure that forms a two-dimensional lattice with up to 49 × 49 nodes on a photonic chip. We demonstrate spatial two-dimensional quantum walks using heralded single photons and single photon-level imaging. We analyze the quantum transport properties via observing the ballistic evolution pattern and the variance profile, which agree well with simulation results. We further reveal the transient nature that is the unique feature for quantum walks of beyond one dimension. An architecture that allows a quantum walk to freely evolve in all directions and at a large scale, combining with defect and disorder control, may bring up powerful and versatile quantum walk machines for classically intractable problems.
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 walks are powerful kernels for developing new and useful quantum algorithms. Here we realize large-scale quantum walks using a fully programmable photonic quantum computing system. The system integrates a silicon quantum photonic chip, enabling the simulation of quantum walk dynamics on graphs with up to 400 vertices and possessing full programmability over quantum walk parameters, including the particle property, initial state, graph structure, and evolution time. In the 400-dimensional Hilbert space, the average fidelity of random entangled quantum states after the whole on-chip circuit evolution reaches as high as 94.29$\pm1.281.281.28\%$. With the system, we demonstrated exponentially faster hitting and quadratically faster mixing performance of quantum walks over classical random walks, achieving more than two orders of magnitude of enhancement in the experimental hitting efficiency and almost half of the reduction in the experimental evolution time for mixing. We utilize the system to implement a series of quantum applications, including measuring the centrality of scale-free networks, searching targets on Erdös-Rényi networks, distinguishing non-isomorphic graph pairs, and simulating the topological phase of higher-order topological insulators. Our work shows one feasible path for quantum photonics to address applications of practical interests in the near future.
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.
Applications of quantum walks can depend on the number, exchange symmetry and indistinguishability of the particles involved, and the underlying graph structures where they move. Here, we show that silicon photonics, by exploiting an entanglement-driven scheme, can realize quantum walks with full control over all these properties in one device. The device we realize implements entangled two-photon quantum walks on any five-vertex graph, with continuously tunable particle exchange symmetry and indistinguishability. We show how this simulates single-particle walks on larger graphs, with size and geometry controlled by tuning the properties of the composite quantum walkers. We apply the device to quantum walk algorithms for searching vertices in graphs and testing for graph isomorphisms. In doing so, we implement up to 100 sampled time steps of quantum walk evolution on each of 292 different graphs. This opens the way to large-scale, programmable quantum walk processors for classically intractable applications.