Integrated optics is an engineering solution proposed for exquisite control of photonic quantum information. Here we use silicon photonics and the linear combination of quantum operators scheme to realise a fully programmable two-qubit quantum processor. The device is fabricated with readily available CMOS based processing and comprises four nonlinear photon-sources, four filters, eightytwo beam splitters and fifty-eight individually addressable phase shifters. To demonstrate performance, we programmed the device to implement ninety-eight various two-qubit unitary operations (with average quantum process fidelity of 93.2±4.5%), a two-qubit quantum approximate optimization algorithm and efficient simulation of Szegedy directed quantum walks. This fosters further use of the linear combination architecture with silicon photonics for future photonic quantum processors.The range and quality of control that a device has over quantum physics determines the extent of quantum information processing (QIP) tasks that it can perform. One device capable of performing any given QIP task is an ultimate goal 1 and silicon quantum photonics 2 has attractive traits to achieve this: photonic qubits are robust to environmental noise 5 , single qubit operations can be performed with high precision 16 , a high density of reconfigurable components have been used to manipulate coherent light 5,6 and established fabrication processes are CMOS compatible. However, quantum control needs to include entangling operations to be relevant to QIPthis is recognised as one of the most challenging tasks for photonics because of the extra resources required for each entangling step 5,6 . Here, we demonstrate a programmable silicon photonics chip that generates two photonic qubits, on which it then performs arbitrary twoqubit untiary operations, including arbitrary entangling operations. This is achieved by using silicon photonics to reach the complexity required to implement an iteration of the linear combination of unitaries architecture 8,9 that we have adapted to realise universal two-qubit processing. The device's performance shows that the design and fabrication techniques used in its implementation work well with the linear combination architecture and can be used to realise larger and more powerful photonic quantum processors.Miniaturisation of quantum-photonic experiments into chip-scale waveguide circuits started 10 from the need to realise many-mode devices with inherent sub-wavelength stability for generalised quantum-interference experi-ments, such as multi-photon quantum walks 11 and boson sampling 12-14 . Universal six-mode linear optics implemented with a silica waveguide chip (coupled to free-space photon sources and fibre-coupled detectors) demonstrated the principle that single photonic devices can be configured to perform any given linear optics task 15 . Silicon waveguides promise even greater capability for large-scale photonic processing, because of their third order nonlinearity that enables photon pair generation within integ...

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.

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. We apply our method to study random quantum circuits, which are outstanding candidates to demonstrate quantum supremacy on quantum computers that supports nearest-neighbour gate operations on a two-dimensional configuration. Our approach allows to quantify precisely the memory usage and the time requirements of random quantum circuits, thus showing the frontier of quantum supremacy. Applying this general quantum circuit simulator we measured amplitudes for a 7 × 7 lattice of qubits with depth (1 + 40 + 1) and double-precision numbers in 31 minutes using less than 93 TB memory on the Tianhe-2 supercomputer. Our analytic complexity bounds also show that simulating a 8 × l circuit (l > 8) with depth (1 + 40 + 1), or a 10 × l (l > 10) circuit with depth (1 + 32 + 1) is within reach of current supercomputers.Quantum computers offer the promise of efficiently solving certain problems that are intractable for classical computers, most famously factorizing large numbers [1][2][3]. With the rapid progress of various quantum systems towards Noisy Intermediate-Scale Quantum computing devices [4][5][6][7][8][9][10][11], we are now on the verge of quantum supremacy [12], i.e. demonstrating that an actual quantum computer has the ability to do a computation that no classical computers can tackle, an important milestone in the field of computer science. Various candidates have been suggested to demonstrate quantum supremacy, such as BosonSampling [13,14], the instantaneous quantum polynomial protocol [15,16] and random quantum circuits (RQCs) [3,17] which demand less physical resources and are easier to implement compared to, for instance, factorization. The central aspect for all these near-term supremacy proof-of-principle computations, which poses fundamental limitations to classical computations, is that the quantum states produced, and from which we wish to sample configurations, live in a Hilbert space that grows exponentially with the system size.In view of recent progresses in quantum computing hardware, it is important to find effective ways to simulate accurately quantum algorithms on classical computers. While the quantum circuit simulator we present can tackle generic circuits, in the following we focus on RQCs. They consist of a series of single and two-qubit gates which are applied to different qubits in a particular order. A group of commuting gates which can be applied simultaneously constitute one layer of the circuit, and the more groups of operations that do not commute, the deeper the circuit is. The qualification of random circuit comes from the fact that the single-qubit gates applied are chosen at random from a small set of them (for more details about...

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 (>60  dB) 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.

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.

We experimentally demonstrate a high-spectral-purity photon source by designing a dual-Mach–Zehnder-interferometer-coupled silicon ring resonator, wherein the linewidths of pump and signal (idler) resonances can be engineered independently. A high spectral purity of 95 % ± 1.5 % is obtained via a time-integrated g ( 2 ) correlation measurement, which exceeds the theoretical 93% bound of a traditional ring’s spontaneous four-wave-mixing photon source. This source also possesses high performance in other metrics including a measured coincidence of 9599 pairs/s and a preparation heralding efficiency of 52.4% at a relatively low pump power of 61 µW as well as high drop-to-through suppression of 20.2 dB. By overcoming the trade-off between spectral purity and brightness in the post-filtering way, such a method guarantees bright pure photons and will pave the way for development of on-chip quantum information processing with improved operation fidelity and efficiency.

Studies on graph isomorphism play an important role in graph research, and graph isomorphism algorithms have a wide range of applications in image matching, pattern recognition, computer vision, biochemistry and other fields. Previous research demonstrated that involving discrete-time quantum walk in the graph isomorphism algorithm could achieve complexity O(N 7 ) for general graphs, since quantum walk could be utilized as a new toolbox for solving graph problems. We develop an enhanced classical approach to graph isomorphism using continuous-time quantum walk, which has lower complexity O(N 5 ) and can effectively distinguish the graphs that are generally considered difficult. In addition, we define a graph similarity measure based on the proposed algorithm, which can be used for graph isomorphism and graph clustering. In the experiment, we test a wide variety of classes of graphs; the results show that the algorithm has a wide range of applications rather than being limited to a specific type of graph.

Client-server models enable computations to be hosted remotely on quantum servers. We present a novel protocol for realizing this task, with practical advantages when using technology feasible in the near term. Client tasks are realized as linear combinations of operations implemented by the server, where the linear coefficients are hidden from the server. We report on an experimental demonstration of our protocol using linear optics, which realizes linear combination of two single-qubit operations by a remote single-qubit control. In addition, we explain when our protocol can remain efficient for larger computations, as well as some ways in which privacy can be maintained using our protocol.