Quantum Slide and NAND Tree on a Photonic Chip
arXiv:2001.08755 · doi:10.1103/PhysRevLett.125.160502
Abstract
In the age of 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 has been proposed that the solving of NAND-tree problem can be sped up by quantum walk. Such scheme is groundbreaking due to the universality of NAND gate. However, experimental demonstration has never 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 "quantum slide", where a propagating Gaussian wave-packet can be generated deterministically along a properly-engineered chain. In this way, the optical computation can be achieved with ordinary laser light instead of single photon, and the output can be obtained by single-shot measurements instead of repeated quantum measurements. 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 quantum slide may find other interesting applications in quantum information and quantum optics.
arXiv comment14 pages, 11 figures, 1 table, comments welcome
References in corpus (25)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Computation and Decision Trees
- Perfect state transfer in quantum spin networks
- Universal computation by quantum walk
- Quantum walks of correlated particles
- Boson Sampling on a Photonic Chip
- Experimental Boson Sampling
- Experimental boson sampling in arbitrary integrated photonic circuits
- Photonic Boson Sampling in a Tunable Circuit
- Realization of quantum walks with negligible decoherence in waveguide lattices
- Universal computation by multi-particle quantum walk
- Dynamics and manipulation of entanglement in coupled harmonic systems with many degrees of freedom
- Experimental Two-dimensional Quantum Walk on a Photonic Chip
- Quantum speedup for active learning agents
- Experimental Quantum Fast Hitting on Hexagonal Graphs
- Tuneable quantum interference in a 3D integrated circuit
- A Quantum Algorithm for the Hamiltonian NAND Tree
- Discrete-query quantum algorithm for NAND trees
- A nearly optimal discrete query quantum algorithm for evaluating NAND formulas
- Parity-Induced Thermalization Gap in Disordered Ring Lattices
- Every NAND formula of size N can be evaluated in time N^{1/2+o(1)} on a quantum computer
- Direct measurement of second-order coupling in a waveguide lattice
- Levinson's theorem for graphs II
- Levinson's theorem for graphs
- Molecular Realization of a Quantum NAND Tree