August 2024

We present a protocol that maximizes unconditional entanglement generation between two masses interacting directly through $1/r^{n}$ potential. The protocol combines optimal quantum control of continuously measured masses with their non-equilibrium dynamics, driven by a time-dependent interaction strength. Applied to a pair of optically trapped sub-micron particles coupled via electrostatic interaction, our protocol enables unconditional entanglement generation at the fundamental limit of the conditional state and with an order of magnitude smaller interaction between the masses compared to the existing steady-state approaches.

We develop a feedback strategy based on optimal quantum feedback control for Gaussian systems to maximise the likelihood of steady-state entanglement detection between two directly interacting masses. We employ linear quadratic Gaussian (LQG) control to engineer the phase space dynamics of the two masses and propose Einstein-Podolsky-Rosen (EPR)-type variance minimisation constraints for the feedback to facilitate unconditional entanglement generation. This scheme allows for stationary entanglement in parameter regimes where strategies based on total energy minimisation ($cooling$) would fail. This feedback strategy, applied to the system of two masses driven out-of-thermal equilibrium [arXiv:2408.06251] enables unconditional entanglement generation under realistic experimental conditions.

Quantum computing and AI have found a fruitful intersection in the field of natural language processing. We focus on the recently proposed DisCoCirc framework for natural language, and propose a quantum adaptation, QDisCoCirc. This is motivated by a compositional approach to rendering AI interpretable: the behavior of the whole can be understood in terms of the behavior of parts, and the way they are put together. For the model-native primitive operation of text similarity, we derive quantum algorithms for fault-tolerant quantum computers to solve the task of question-answering within QDisCoCirc, and show that this is BQP-hard; note that we do not consider the complexity of question-answering in other natural language processing models. Assuming widely-held conjectures, implementing the proposed model classically would require super-polynomial resources. Therefore, it could provide a meaningful demonstration of the power of practical quantum processors. The model construction builds on previous work in compositional quantum natural language processing. Word embeddings are encoded as parameterized quantum circuits, and compositionality here means that the quantum circuits compose according to the linguistic structure of the text. We outline a method for evaluating the model on near-term quantum processors, and elsewhere we report on a recent implementation of this on quantum hardware. In addition, we adapt a quantum algorithm for the closest vector problem to obtain a Grover-like speedup in the fault-tolerant regime for our model. This provides an unconditional quadratic speedup over any classical algorithm in certain circumstances, which we will verify empirically in future work.

Recently, machine learning had a remarkable impact, from scientific to everyday-life applications. However, complex tasks often imply unfeasible energy and computational power consumption. Quantum computation might lower such requirements, although it is unclear whether enhancements are reachable by current technologies. Here, we demonstrate a kernel method on a photonic integrated processor to perform a binary classification. We show that our protocol outperforms state-of-the-art kernel methods including gaussian and neural tangent kernels, exploiting quantum interference, and brings a smaller improvement also by single photon coherence. Our scheme does not require entangling gates and can modify the system dimension through additional modes and injected photons. This result opens to more efficient algorithms and to formulating tasks where quantum effects improve standard methods.