20 August 2018 in Nature Photonics
5 May 2016 in Nature Communications
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor.
11 November 2016 in Optics Letters
Imperfections in integrated photonics manufacturing have a detrimental effect on the maximal achievable visibility in interferometric architectures. These limits have profound implications for further technological developments in photonics and in particular for quantum photonic technologies. Active optimization approaches, together with reconfigurable photonics, have been proposed as a solution to overcome this. In this Letter, we demonstrate an ultrahigh () extinction ratio in a silicon photonic device consisting of cascaded Mach–Zehnder interferometers, in which additional interferometers function as variable beamsplitters. The imperfections of fabricated beamsplitters are compensated using an automated progressive optimization algorithm with no requirement for pre-calibration. This work shows the possibility of integrating and accurately controlling linear-optical components for large-scale quantum information processing and other applications.
4 November 2019 in Physical Review Letters
Recent advances on quantum computing hardware have pushed quantum computing to the verge of quantum supremacy. Here, we bring together many-body quantum physics and quantum computing by using a method for strongly interacting two-dimensional systems, the projected entangled-pair states, to realize an effective general-purpose simulator of quantum algorithms. The classical computing complexity of this simulator is directly related to the entanglement generation of the underlying quantum circuit rather than the number of qubits or gate operations. We apply our method to study random quantum circuits, which allows us to quantify precisely the memory usage and the time requirements of random quantum circuits. We demonstrate our method by computing one amplitude for a lattice of qubits with depth () on the Tianhe-2 supercomputer.
26 February 2021 in Science Advances
Programmable silicon photonics realizes universal control over quantum walks.
1 January 2024 in Intelligent Computing
The classical random walk formalism plays an important role in a wide range of applications. Its quantum counterpart, the quantum walk, is proposed as an important theoretical model for quantum computing. By exploiting quantum effects such as superposition, interference, and entanglement, quantum walks and their variations have been extensively studied for achieving computing power beyond that of classical computing and have been broadly used in designing quantum algorithms for algebraic and optimization problems, graph and network analysis, and quantum Hamiltonian and biochemical process simulations. Moreover, quantum walk models have been proven capable of universal quantum computation. Unlike conventional quantum circuit models, quantum walks provide a feasible path for implementing application-specific quantum computing, particularly in the noisy intermediate-scale quantum era. Recently, remarkable progress has been achieved in implementing a wide variety of quantum walks and quantum walk applications, which demonstrates the great potential of quantum walks. In this review, we provide a thorough summary of quantum walks and quantum walk computing, including theories and characteristics, physical implementations, and applications. We also discuss the challenges facing quantum walk computing, which aims to realize a practical quantum computer in the near future.