Quantum circuits with many photons on a programmable nanophotonic chip.

Growing interest in quantum computing for practical applications has led to a surge in the availability of programmable machines for executing quantum algorithms. Present-day photonic quantum computers have been limited either to non-deterministic operation, low photon numbers and rates, or fixed random gate sequences. Here we introduce a full-stack hardware-software system for executing many-photon quantum circuit operations using integrated nanophotonics: a programmable chip, operating at room temperature and interfaced with a fully automated control system.

Quantum Simulation of Helium Hydride Cation in a Solid-State Spin Register.

Ab initio computation of molecular properties is one of the most promising applications of quantum computing. While this problem is widely believed to be intractable for classical computers, efficient quantum algorithms exist which have the potential to vastly accelerate research throughput in fields ranging from material science to drug discovery. Using a solid-state quantum register realized in a nitrogen-vacancy (NV) defect in diamond, we compute the bond dissociation curve of the minimal basis helium hydride cation, HeH(+).

High-fidelity spin entanglement using optimal control.

Precise control of quantum systems is of fundamental importance in quantum information processing, quantum metrology and high-resolution spectroscopy. When scaling up quantum registers, several challenges arise: individual addressing of qubits while suppressing cross-talk, entangling distant nodes and decoupling unwanted interactions. Here we experimentally demonstrate optimal control of a prototype spin qubit system consisting of two proximal nitrogen-vacancy centres in diamond.

Quantum circuits for general multiqubit gates.

We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits-a unitary transformation with 4(n) degrees of freedom. For synthesizing the gate sequence, a method based on the so-called cosine-sine matrix decomposition is presented. The result is optimal in the number of elementary one-qubit gates, 4(n), and scales more favorably than the previously reported decompositions requiring 4(n)-2(n+1) controlled NOT gates.