Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userExperimental quantum speed-up in reinforcement learning agents
185
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Increasing demand for algorithms that can learn quickly and efficiently has led to a surge of development within the field of artificial intelligence (AI). An important paradigm within AI is reinforcement learning (RL), where agents interact with environments by exchanging signals via a communication channel. Agents can learn by updating their behaviour based on obtained feedback. The crucial question for practical applications is how fast agents can learn to respond correctly. An essential figure of merit is therefore the learning time. While various works have made use of quantum mechanics to speed up the agents decision-making process, a reduction in learning time has not been demonstrated yet. Here we present a RL experiment where the learning of an agent is boosted by utilizing a quantum communication channel with the environment. We further show that the combination with classical communication enables the evaluation of such an improvement, and additionally allows for optimal control of the learning progress. This novel scenario is therefore demonstrated by considering hybrid agents, that alternate between rounds of quantum and classical communication. We implement this learning protocol on a compact and fully tunable integrated nanophotonic processor. The device interfaces with telecom-wavelength photons and features a fast active feedback mechanism, allowing us to demonstrate the agents systematic quantum advantage in a setup that could be readily integrated within future large-scale quantum communication networks.
rate research
Read More
Finding optical setups producing measurement results with a targeted probability distribution is hard as a priori the number of possible experimental implementations grows exponentially with the number of modes and the number of devices. To tackle this complexity, we introduce a method combining reinforcement learning and simulated annealing enabling the automated design of optical experiments producing results with the desired probability distributions. We illustrate the relevance of our method by applying it to a probability distribution favouring high violations of the Bell-CHSH inequality. As a result, we propose new unintuitive experiments leading to higher Bell-CHSH inequality violations than the best currently known setups. Our method might positively impact the usefulness of photonic experiments for device-independent quantum information processing.
Over the past few years several quantum machine learning algorithms were proposed that promise quantum speed-ups over their classical counterparts. Most of these learning algorithms either assume quantum access to data -- making it unclear if quantum speed-ups still exist without making these strong assumptions, or are heuristic in nature with no provable advantage over classical algorithms. In this paper, we establish a rigorous quantum speed-up for supervised classification using a general-purpose quantum learning algorithm that only requires classical access to data. Our quantum classifier is a conventional support vector machine that uses a fault-tolerant quantum computer to estimate a kernel function. Data samples are mapped to a quantum feature space and the kernel entries can be estimated as the transition amplitude of a quantum circuit. We construct a family of datasets and show that no classical learner can classify the data inverse-polynomially better than random guessing, assuming the widely-believed hardness of the discrete logarithm problem. Meanwhile, the quantum classifier achieves high accuracy and is robust against additive errors in the kernel entries that arise from finite sampling statistics.
We present a collision model for the charging of a quantum battery by identical nonequilibrium qubit units. When the units are prepared in a mixture of energy eigenstates, the energy gain in the battery can be described by a classical random walk, where both average energy and variance grow linearly with time. Conversely, when the qubits contain quantum coherence, interference effects buildup in the battery and lead to a faster spreading of the energy distribution, reminiscent of a quantum random walk. This can be exploited for faster and more efficient charging of a battery initialized in the ground state. Specifically, we show that coherent protocols can yield higher charging power than any possible incoherent strategy, demonstrating a quantum speed-up at the level of a single battery. Finally, we characterize the amount of extractable work from the battery through the notion of ergotropy.
We propose a method of accelerating the speed of evolution of an open system by an external classical driving field for a qubit in a zero-temperature structured reservoir. It is shown that, with a judicious choice of the driving strength of the applied classical field, a speed-up evolution of an open system can be achieved in both the weak system-environment couplings and the strong system-environment couplings. By considering the relationship between non-Makovianity of environment and the classical field, we can drive the open system from the Markovian to the non-Markovian regime by manipulating the driving strength of classical field. That is the intrinsic physical reason that the classical field may induce the speed-up process. In addition, the roles of this classical field on the variation of quantum evolution speed in the whole decoherence process is discussed.
We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo Markov Chain method and use non-adaptive cooling schedules. The improvement in time complexity is twofold: a quadratic reduction with respect to the spectral gap of the underlying Markov chains and a quadratic reduction with respect to the parameter characterizing the desired accuracy of the estimate output by the FPRAS. Both reductions are intimately related and cannot be achieved separately. First, we use Grovers fixed point search, quantum walks and phase estimation to efficiently prepare approximate coherent encodings of stationary distributions of the Markov chains. The speed-up we obtain in this way is due to the quadratic relation between the spectral and phase gaps of classical and quantum walks. Second, we generalize the method of quantum counting, showing how to estimate expected values of quantum observables. Using this method instead of classical sampling, we obtain the speed-up with respect to accuracy.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
