Active learning machine learns to create new quantum experiments.

How useful can machine learning be in a quantum laboratory? Here we raise the question of the potential of intelligent machines in the context of scientific research. A major motivation for the present work is the unknown reachability of various entanglement classes in quantum experiments. We investigate this question by using the projective simulation model, a physics-oriented approach to artificial intelligence. In our approach, the projective simulation system is challenged to design complex photonic quantum experiments that produce high-dimensional entangled multiphoton states, which are of high interest in modern quantum experiments. The artificial intelligence system learns to create a variety of entangled states and improves the efficiency of their realization. In the process, the system autonomously (re)discovers experimental techniques which are only now becoming standard in modern quantum optical experiments-a trait which was not explicitly demanded from the system but emerged through the process of learning. Such features highlight the possibility that machines could have a significantly more creative role in future research.

Setting Up Experimental Bell Tests with Reinforcement Learning.

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-Clauser-Horne-Shimony-Holt (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.

Short-lived intermediates in photochemistry of an OsCl62- complex in aqueous solutions.

Two mechanisms of OsIVCl62- photolysis were studied by means of quantum chemical calculations in gas and aqueous phases. The difference between these mechanisms is in the nature of the possible Os(iv) key intermediates (KI). According to calculations, the intermediate is an OsIVCl5- complex of square pyramidal coordination geometry. The calculations do not give an opportunity to make an unambiguous choice between the triplet and quintet multiplicities of OsIVCl5-. The calculated CASSCF/IMCP-SR1 transition energies for 5OsIVCl5- are lower than for 3OsIVCl5-, while the calculated XMC-QDPT2/SBKJC spectra for the triplet state are in better agreement with the experimental absorption spectrum of the KI than for the quintet state.

Quantum walk processes in quantum devices.

Simulation and programming of current quantum computers as Noisy Intermediate-Scale Quantum (NISQ) devices represent a hot topic at the border of current physical and information sciences. The quantum walk process represents a basic subroutine in many quantum algorithms and plays an important role in studying physical phenomena. Simulating quantum walk processes is computationally challenging for classical processors. With an increasing improvement in qubits fidelity and qubits number in a single register, there is a potential to improve quantum walks simulations substantially. However, efficient ways to simulate quantum walks in qubit registers still have to be explored. Here, we explore the relationship between quantum walk on graphs and quantum circuits. Firstly, we discuss ways to obtain graphs provided quantum circuit. We then explore techniques to represent quantum walk on a graph as a quantum circuit. Specifically, we study hypercube graphs and arbitrary graphs. Our approach to studying the relationship between graphs and quantum circuits paves way for the efficient implementation of quantum walks algorithms on quantum computers.

Projective simulation with generalization.

The ability to generalize is an important feature of any intelligent agent. Not only because it may allow the agent to cope with large amounts of data, but also because in some environments, an agent with no generalization capabilities cannot learn. In this work we outline several criteria for generalization, and present a dynamic and autonomous machinery that enables projective simulation agents to meaningfully generalize. Projective simulation, a novel, physical approach to artificial intelligence, was recently shown to perform well in standard reinforcement learning problems, with applications in advanced robotics as well as quantum experiments. Both the basic projective simulation model and the presented generalization machinery are based on very simple principles. This allows us to provide a full analytical analysis of the agent's performance and to illustrate the benefit the agent gains by generalizing. Specifically, we show that already in basic (but extreme) environments, learning without generalization may be impossible, and demonstrate how the presented generalization machinery enables the projective simulation agent to learn.

Quantum walks of interacting fermions on a cycle graph.

Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In this work quantum walks of electrons on a graph are studied. The graph is composed of semiconductor quantum dots arranged in a circle. Electrons can tunnel between adjacent dots and interact via Coulomb repulsion, which leads to entanglement. Fermionic entanglement dynamics is obtained and evaluated.

Coherent controlization using superconducting qubits.

Coherent controlization, i.e., coherent conditioning of arbitrary single- or multi-qubit operations on the state of one or more control qubits, is an important ingredient for the flexible implementation of many algorithms in quantum computation. This is of particular significance when certain subroutines are changing over time or when they are frequently modified, such as in decision-making algorithms for learning agents. We propose a scheme to realize coherent controlization for any number of superconducting qubits coupled to a microwave resonator. For two and three qubits, we present an explicit construction that is of high relevance for quantum learning agents. We demonstrate the feasibility of our proposal, taking into account loss, dephasing, and the cavity self-Kerr effect.

Ultrafast photophysical processes for Fe(III)-carboxylates.

Photochemical reactions with the participation of iron(iii) carboxylates are important for environmental photochemistry and have a great potential of application in water purification (advanced oxidation processes, photo-Fenton and Fenton-like processes). In spite of this, information about excited states and primary intermediates in the photochemistry of Fe(iii) complexes with carboxylic acids is scarce. This mini-review presents and discusses the results of several recent publications in the field of ultrafast spectroscopy of natural Fe(iii) carboxylates.