Universal quantum computers promise a dramatic speed-up over classical computers but a full-size realization remains challenging. However, intermediate quantum computational models have been proposed that are not universal, but can solve problems tha
t are strongly believed to be classically hard. Aaronson and Arkhipov have shown that interference of single photons in random optical networks can solve the hard problem of sampling the bosonic output distribution which is directly connected to computing matrix permanents. Remarkably, this computation does not require measurement-based interactions or adaptive feed-forward techniques. Here we demonstrate this model of computation using high--quality laser--written integrated quantum networks that were designed to implement random unitary matrix transformations. We experimentally characterize the integrated devices using an in--situ reconstruction method and observe three-photon interference that leads to the boson-sampling output distribution. Our results set a benchmark for quantum computers, that hold the potential of outperforming conventional ones using only a few dozen photons and linear-optical elements.
Photonic quantum simulators are promising candidates for providing insight into other small- to medium-sized quantum systems. The available photonic quantum technology is reaching the state where significant advantages arise for the quantum simulatio
n of interesting questions in Heisenberg spin systems. Here we experimentally simulate such spin systems with single photons and linear optics. The effective Heisenberg-type interactions among individual single photons are realized by quantum interference at the tunable direction coupler followed by the measurement process. The effective interactions are characterized by comparing the entanglement dynamics using pairwise concurrence of a four-photon quantum system. We further show that photonic quantum simulations of generalized Heisenberg interactions on a four-site square lattice and a six-site checkerboard lattice are in reach of current technology.
Quantum entanglement is widely recognized as one of the key resources for the advantages of quantum information processing, including universal quantum computation, reduction of communication complexity or secret key distribution. However, computatio
nal models have been discovered, which consume very little or no entanglement and still can efficiently solve certain problems thought to be classically intractable. The existence of these models suggests that separable or weakly entangled states could be extremely useful tools for quantum information processing as they are much easier to prepare and control even in dissipative environments. It has been proposed that a requirement for useful quantum states is the generation of so-called quantum discord, a measure of non-classical correlations that includes entanglement as a subset. Although a link between quantum discord and few quantum information tasks has been studied, its role in computation speed-up is still open and its operational interpretation remains restricted to only few somewhat contrived situations. Here we show that quantum discord is the optimal resource for the remote quantum state preparation, a variant of the quantum teleportation protocol. Using photonic quantum systems, we explicitly show that the geometric measure of quantum discord is related to the fidelity of this task, which provides an operational meaning. Moreover, we demonstrate that separable states with non-zero quantum discord can outperform entangled states. Therefore, the role of quantum discord might provide fundamental insights for resource-efficient quantum information processing.
