Search

The double descent phenomenon challenges traditional statistical learning theory by revealing scenarios where larger models do not necessarily lead to reduced performance on unseen data. While this counterintuitive behavior has been observed in a variety of classical machine learning models, particularly modern neural network architectures, it remains elusive within the context of quantum machine learning. In this work, we analytically demonstrate that quantum learning models can exhibit double descent behavior by drawing on insights from linear regression and random matrix theory. Additionally, our numerical experiments on quantum kernel methods across different real-world datasets and system sizes further confirm the existence of a test error peak, a characteristic feature of double descent. Our findings provide evidence that quantum models can operate in the modern, overparameterized regime without experiencing overfitting, thereby opening pathways to improved learning performance beyond traditional statistical learning theory.

Quantum repeaters play a crucial role in the effective distribution of entanglement over long distances. The nearest-future type of quantum repeater requires two operations: entanglement generation across neighbouring repeaters and entanglement swapping to promote short-range entanglement to long-range. For many hardware setups, these actions are probabilistic, leading to longer distribution times and incurred errors. Significant efforts have been vested in finding the optimal entanglement-distribution policy, i.e. the protocol specifying when a network node needs to generate or swap entanglement, such that the expected time to distribute long-distance entanglement is minimal. This problem is even more intricate in more realistic scenarios, especially when classical communication delays are taken into account. In this work, we formulate our problem as a Markov decision problem and use reinforcement learning (RL) to optimise over centralised strategies, where one designated node instructs other nodes which actions to perform. Contrary to most RL models, ours can be readily interpreted. Additionally, we introduce and evaluate a fixed local policy, the `predictive swap-asap' policy, where nodes only coordinate with nearest neighbours. Compared to the straightforward generalization of the common swap-asap policy to the scenario with classical communication effects, the `wait-for-broadcast swap-asap' policy, both of the aforementioned entanglement-delivery policies are faster at high success probabilities. Our work showcases the merit of considering policies acting with incomplete information in the realistic case when classical communication effects are significant., Comment: 16 pages, 8 figures

We investigate automated in situ optimization of the potential landscape in a quantum point contact device, using a $3 \times 3$ gate array patterned atop the constriction. Optimization is performed using the covariance matrix adaptation evolutionary strategy, for which we introduce a metric for how "step-like" the conductance is as the channel becomes constricted. We first perform the optimization of the gate voltages in a tight-binding simulation and show how such in situ tuning can be used to mitigate a random disorder potential. The optimization is then performed in a physical device in experiment, where we also observe a marked improvement in the quantization of the conductance resulting from the optimization procedure., Comment: 8 pages, 4 figures (supplement: 6 pages, 3 figures)

As the field of quantum physics evolves, researchers naturally form subgroups focusing on specialized problems. While this encourages in-depth exploration, it can limit the exchange of ideas across structurally similar problems in different subfields. To encourage cross-talk among these different specialized areas, data-driven approaches using machine learning have recently shown promise to uncover meaningful connections between research concepts, promoting cross-disciplinary innovation. Current state-of-the-art approaches represent concepts using knowledge graphs and frame the task as a link prediction problem, where connections between concepts are explicitly modeled. In this work, we introduce a novel approach based on dynamic word embeddings for concept combination prediction. Unlike knowledge graphs, our method captures implicit relationships between concepts, can be learned in a fully unsupervised manner, and encodes a broader spectrum of information. We demonstrate that this representation enables accurate predictions about the co-occurrence of concepts within research abstracts over time. To validate the effectiveness of our approach, we provide a comprehensive benchmark against existing methods and offer insights into the interpretability of these embeddings, particularly in the context of quantum physics research. Our findings suggest that this representation offers a more flexible and informative way of modeling conceptual relationships in scientific literature., Comment: 7 pages; 4 figures; 1 table; Appendix: 2 pages, 2 figures

Tunneling spectroscopy is an important tool for the study of both real-space and momentum-space electronic structure of correlated electron systems. However, such measurements often yield noisy data. Machine learning provides techniques to reduce the noise in post-processing, but traditionally requires noiseless examples which are unavailable for scientific experiments. In this work we adapt the unsupervised Noise2Noise and self-supervised Noise2Self algorithms, which allow for denoising without clean examples, to denoise quasiparticle interference data. We first apply the techniques on simulated data, and demonstrate that we are able to reduce the noise while preserving finer details, all while outperforming more traditional denoising techniques. We then apply the Noise2Self technique to experimental data from an overdoped cuprate ((Pb,Bi)$_2$Sr$_2$CuO$_{6+\delta}$) sample. Denoising enhances the clarity of quasiparticle interference patterns, and helps to obtain a precise extraction of electronic structure parameters. Self-supervised denoising is a promising tool for denoising quasiparticle interference data, facilitating deeper insights into the physics of complex materials., Comment: 7 pages, 5 figures, plus 4 pages and 5 figures appendix

The search for useful applications of noisy intermediate-scale quantum (NISQ) devices in quantum simulation has been hindered by their intrinsic noise and the high costs associated with achieving high accuracy. A promising approach to finding utility despite these challenges involves using quantum devices to generate training data for classical machine learning (ML) models. In this study, we explore the use of noisy data generated by quantum algorithms in training an ML model to learn a density functional for the Fermi-Hubbard model. We benchmark various ML models against exact solutions, demonstrating that a neural-network ML model can successfully generalize from small datasets subject to noise typical of NISQ algorithms. The learning procedure can effectively filter out unbiased sampling noise, resulting in a trained model that outperforms any individual training data point. Conversely, when trained on data with expressibility and optimization error typical of the variational quantum eigensolver, the model replicates the biases present in the training data. The trained models can be applied to solving new problem instances in a Kohn-Sham-like density optimization scheme, benefiting from automatic differentiability and achieving reasonably accurate solutions on most problem instances. Our findings suggest a promising pathway for leveraging NISQ devices in practical quantum simulations, highlighting both the potential benefits and the challenges that need to be addressed for successful integration of quantum computing and ML techniques., Comment: 13 pages, 6 figures

The search for quantum algorithms to tackle classical combinatorial optimization problems has long been one of the most attractive yet challenging research topics in quantum computing. In this context, variational quantum algorithms (VQA) are a promising family of hybrid quantum-classical methods tailored to cope with the limited capability of near-term quantum hardware. However, their effectiveness is hampered by the complexity of the classical parameter optimization which is prone to getting stuck either in local minima or in flat regions of the cost-function landscape. The clever design of efficient optimization methods is therefore of fundamental importance for fully leveraging the potential of VQAs. In this work, we approach parameter optimization as a sequential decision-making problem and tackle it with an adaptation of Monte Carlo Tree Search (MCTS), a common artificial intelligence technique designed for efficiently exploring complex decision graphs. We show that leveraging regular parameter patterns deeply affects the decision-tree structure and allows for a flexible and noise-resilient optimization strategy suitable for near-term quantum devices. Our results shed further light on the interplay between artificial intelligence and quantum information and provide a valuable addition to the toolkit of variational quantum circuits., Comment: 11+7 pages, 7+6 figures

We demonstrate reliable machine-learned tuning of quantum-dot-based artificial Kitaev chains to Majorana sweet spots, using the covariance matrix adaptation algorithm. We show that a loss function based on local tunnelling-spectroscopy features of a chain with two additional sensor dots added at its ends provides a reliable metric to navigate parameter space and find points where crossed Andreev reflection and elastic cotunneling between neighbouring sites balance in such a way to yield near-zero-energy modes with very high Majorana quality. We simulate tuning of two- and three-site Kitaev chains, where the loss function is found from calculating the low-energy spectrum of a model Hamiltonian that includes Coulomb interactions and finite Zeeman splitting. In both cases, the algorithm consistently converges towards high-quality sweet spots. Since tunnelling spectroscopy provides one global metric for tuning all on-site potentials simultaneously, this presents a promising way towards tuning longer Kitaev chains, which are required for achieving topological protection of the Majorana modes.

Environmental fluctuations degrade the performance of solid-state qubits but can in principle be mitigated by real-time Hamiltonian estimation down to time scales set by the estimation efficiency. We implement a physics-informed and an adaptive Bayesian estimation strategy and apply them in real time to a semiconductor spin qubit. The physics-informed strategy propagates a probability distribution inside the quantum controller according to the Fokker-Planck equation, appropriate for describing the effects of nuclear spin diffusion in gallium-arsenide. Evaluating and narrowing the anticipated distribution by a predetermined qubit probe sequence enables improved dynamical tracking of the uncontrolled magnetic field gradient within the singlet-triplet qubit. The adaptive strategy replaces the probe sequence by a small number of qubit probe cycles, with each probe time conditioned on the previous measurement outcomes, thereby further increasing the estimation efficiency. The combined real-time estimation strategy efficiently tracks low-frequency nuclear spin fluctuations in solid-state qubits, and can be applied to other qubit platforms by tailoring the appropriate update equation to capture their distinct noise sources., Comment: 21 pages, 10 figures, including 11-page 6-figure Supplemental Material

We present QDarts, an efficient simulator for realistic charge stability diagrams of quantum dot array (QDA) devices in equilibrium states. It allows for pinpointing the location of concrete charge states and their transitions in a high-dimensional voltage space (via arbitrary two-dimensional cuts through it), and includes effects of finite tunnel coupling, non-constant charging energy and a simulation of noisy sensor dots. These features enable close matching of various experimental results in the literature, and the package hence provides a flexible tool for testing QDA experiments, as well as opening the avenue for developing new methods of device tuning., Comment: Resubmitted to SciPost Physics Codebases. GitHub repo: https://github.com/condensedAI/QDarts

Feedback-based control is the de-facto standard when it comes to controlling classical stochastic systems and processes. However, standard feedback-based control methods are challenged by quantum systems due to measurement induced backaction and partial observability. Here we remedy this by using weak quantum measurements and model-free reinforcement learning agents to perform quantum control. By comparing control algorithms with and without state estimators to stabilize a quantum particle in an unstable state near a local potential energy maximum, we show how a trade-off between state estimation and controllability arises. For the scenario where the classical analogue is highly nonlinear, the reinforcement learned controller has an advantage over the standard controller. Additionally, we demonstrate the feasibility of using transfer learning to develop a quantum control agent trained via reinforcement learning on a classical surrogate of the quantum control problem. Finally, we present results showing how the reinforcement learning control strategy differs from the classical controller in the non-linear scenarios., Comment: 22 pages, 11 figures, 2 tables

Slow fluctuations of Overhauser fields are an important source for decoherence in spin qubits hosted in III-V semiconductor quantum dots. Focusing on the effect of the field gradient on double-dot singlet-triplet qubits, we present two adaptive Bayesian schemes to estimate the magnitude of the gradient by a series of free induction decay experiments. We concentrate on reducing the computational overhead, with a real-time implementation of the schemes in mind. We show how it is possible to achieve a significant improvement of estimation accuracy compared to more traditional estimation methods. We include an analysis of the effects of dephasing and the drift of the gradient itself., Comment: Submission to SciPost

To leverage the full potential of quantum error-correcting stabilizer codes it is crucial to have an efficient and accurate decoder. Accurate, maximum likelihood, decoders are computationally very expensive whereas decoders based on more efficient algorithms give sub-optimal performance. In addition, the accuracy will depend on the quality of models and estimates of error rates for idling qubits, gates, measurements, and resets, and will typically assume symmetric error channels. In this work, instead, we explore a model-free, data-driven, approach to decoding, using a graph neural network (GNN). The decoding problem is formulated as a graph classification task in which a set of stabilizer measurements is mapped to an annotated detector graph for which the neural network predicts the most likely logical error class. We show that the GNN-based decoder can outperform a matching decoder for circuit level noise on the surface code given only simulated experimental data, even if the matching decoder is given full information of the underlying error model. Although training is computationally demanding, inference is fast and scales approximately linearly with the space-time volume of the code. We also find that we can use large, but more limited, datasets of real experimental data [Google Quantum AI, Nature {\bf 614}, 676 (2023)] for the repetition code, giving decoding accuracies that are on par with minimum weight perfect matching. The results show that a purely data-driven approach to decoding may be a viable future option for practical quantum error correction, which is competitive in terms of speed, accuracy, and versatility., Comment: 15 pages, 12 figures

Unsupervised machine learning models build an internal representation of their training data without the need for explicit human guidance or feature engineering. This learned representation provides insights into which features of the data are relevant for the task at hand. In the context of quantum physics, training models to describe quantum states without human intervention offers a promising approach to gaining insight into how machines represent complex quantum states. The ability to interpret the learned representation may offer a new perspective on non-trivial features of quantum systems and their efficient representation. We train a generative model on two-qubit density matrices generated by a parameterized quantum circuit. In a series of computational experiments, we investigate the learned representation of the model and its internal understanding of the data. We observe that the model learns an interpretable representation which relates the quantum states to their underlying entanglement characteristics. In particular, our results demonstrate that the latent representation of the model is directly correlated with the entanglement measure concurrence. The insights from this study represent proof of concept towards interpretable machine learning of quantum states. Our approach offers insight into how machines learn to represent small-scale quantum systems autonomously.

Machine learning has made important headway in helping to improve the treatment of quantum many-body systems. A domain of particular relevance are correlated inhomogeneous systems. What has been missing so far is a general, scalable deep-learning approach that would enable the rapid prediction of spatial densities for strongly correlated systems in arbitrary potentials. In this work, we present a straightforward scheme, where we learn to predict densities using convolutional neural networks trained on random potentials. While we demonstrate this approach in 1D and 2D lattice models using data from numerical techniques like Quantum Monte Carlo, it is directly applicable as well to training data obtained from experimental quantum simulators. We train networks that can predict the densities of multiple observables simultaneously and that can predict for a whole class of many-body lattice models, for arbitrary system sizes. We show that our approach can handle well the interplay of interference and interactions and the behaviour of models with phase transitions in inhomogeneous situations, and we also illustrate the ability to solve inverse problems, finding a potential for a desired density., Comment: 7 pages, 3 figures

We provide a reusability report of the method presented by Chen et al. in "Optimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks" and add further benchmarks on Max-Cut problems., Comment: 5 pages 3 figures. Nat Mach Intell (2022)

We introduce an algorithm that is able to find the facets of Coulomb diamonds in quantum dot arrays. We simulate these arrays using the constant-interaction model, and rely only on one-dimensional raster scans (rays) to learn a model of the device using regularized maximum likelihood estimation. This allows us to determine, for a given charge state of the device, which transitions exist and what the compensated gate voltages for these are. For smaller devices the simulator can also be used to compute the exact boundaries of the Coulomb diamonds, which we use to assess that our algorithm correctly finds the vast majority of transitions with high precision.

In this book, we provide a comprehensive introduction to the most recent advances in the application of machine learning methods in quantum sciences. We cover the use of deep learning and kernel methods in supervised, unsupervised, and reinforcement learning algorithms for phase classification, representation of many-body quantum states, quantum feedback control, and quantum circuits optimization. Moreover, we introduce and discuss more specialized topics such as differentiable programming, generative models, statistical approach to machine learning, and quantum machine learning., Comment: 288 pages, 92 figures. We have a publishing contract with Cambridge University Press. Figures and tex files are available at https://github.com/Shmoo137/Lecture-Notes

Topological order in solid state systems is often calculated from the integration of an appropriate curvature function over the entire Brillouin zone. At topological phase transitions where the single particle spectral gap closes, the curvature function diverges and changes sign at certain high symmetry points in the Brillouin zone. These generic properties suggest the introduction of a supervised machine learning scheme that uses only the curvature function at the high symmetry points as input data. We apply this scheme to a variety of interacting topological insulators in different dimensions and symmetry classes, and demonstrate that an artificial neural network trained with the noninteracting data can accurately predict all topological phases in the interacting cases with very little numerical effort. Intriguingly, the method uncovers a ubiquitous interaction-induced topological quantum multicriticality in the examples studied., Comment: 8 pages, 3 figures - corrected typos in Fig. 1

Machine learning-inspired techniques have emerged as a new paradigm for analysis of phase transitions in quantum matter. In this work, we introduce a supervised learning algorithm for studying critical phenomena from measurement data, which is based on iteratively training convolutional networks of increasing complexity, and test it on the transverse field Ising chain and q=6 Potts model. At the continuous Ising transition, we identify scaling behavior in the classification accuracy, from which we infer a characteristic classification length scale. It displays a power-law divergence at the critical point, with a scaling exponent that matches with the diverging correlation length. Our algorithm correctly identifies the thermodynamic phase of the system and extracts scaling behavior from projective measurements, independently of the basis in which the measurements are performed. Furthermore, we show the classification length scale is absent for the $q=6$ Potts model, which has a first order transition and thus lacks a divergent correlation length. The main intuition underlying our finding is that, for measurement patches of sizes smaller than the correlation length, the system appears to be at the critical point, and therefore the algorithm cannot identify the phase from which the data was drawn.

We investigate the use of the evolutionary NEAT algorithm for the optimization of a policy network that performs quantum error decoding on the toric code, with bitflip and depolarizing noise, one qubit at a time. We find that these NEAT-optimized network decoders have similar performance to previously reported machine-learning based decoders, but use roughly three to four orders of magnitude fewer parameters to do so., Comment: 10 pages, 7 figures

Rooftop solar is one of the most promising tools for drawing down greenhouse gas (GHG) emissions and is cost-competitive with fossil fuels in many areas of the world today. One of the most important criteria for determining the suitability of a building for rooftop solar is the current age of its roof. The reason for this is simple -- because rooftop solar installations are long-lived, the roof needs to be new enough to last for the lifetime of the solar array or old enough to justify being replaced. In this paper we present a data-driven method for determining the age of a roof from historical satellite imagery, which removes one of the last obstacles to a fully automated pipeline for rooftop solar site selection. We estimate that a full solution to this problem would reduce customer acquisition costs for rooftop solar by $\sim$20\%, leading to an additional $\sim$750 megatons of CO$_2$ displaced between 2020 and 2050.

The efficient validation of quantum devices is critical for emerging technological applications. In a wide class of use-cases the precise engineering of a Hamiltonian is required both for the implementation of gate-based quantum information processing as well as for reliable quantum memories. Inferring the experimentally realized Hamiltonian through a scalable number of measurements constitutes the challenging task of Hamiltonian learning. In particular, assessing the quality of the implementation of topological codes is essential for quantum error correction. Here, we introduce a neural net based approach to this challenge. We capitalize on a family of exactly solvable models to train our algorithm and generalize to a broad class of experimentally relevant sources of errors. We discuss how our algorithm scales with system size and analyze its resilience towards various noise sources., Comment: 15 pages, 12 figures. Code available at https://github.com/cmt-qo/cm-toricCode

We demonstrate quantum many-body state reconstruction from experimental data generated by a programmable quantum simulator, by means of a neural network model incorporating known experimental errors. Specifically, we extract restricted Boltzmann machine (RBM) wavefunctions from data produced by a Rydberg quantum simulator with eight and nine atoms in a single measurement basis, and apply a novel regularization technique to mitigate the effects of measurement errors in the training data. Reconstructions of modest complexity are able to capture one- and two-body observables not accessible to experimentalists, as well as more sophisticated observables such as the R\'enyi mutual information. Our results open the door to integration of machine learning architectures with intermediate-scale quantum hardware., Comment: 15 pages, 13 figures

We introduce NetKet, a comprehensive open source framework for the study of many-body quantum systems using machine learning techniques. The framework is built around a general and flexible implementation of neural-network quantum states, which are used as a variational ansatz for quantum wave functions. NetKet provides algorithms for several key tasks in quantum many-body physics and quantum technology, namely quantum state tomography, supervised learning from wave-function data, and ground state searches for a wide range of customizable lattice models. Our aim is to provide a common platform for open research and to stimulate the collaborative development of computational methods at the interface of machine learning and many-body physics.

Topological error correcting codes, and particularly the surface code, currently provide the most feasible roadmap towards large-scale fault-tolerant quantum computation. As such, obtaining fast and flexible decoding algorithms for these codes, within the experimentally relevant context of faulty syndrome measurements, is of critical importance. In this work, we show that the problem of decoding such codes, in the full fault-tolerant setting, can be naturally reformulated as a process of repeated interactions between a decoding agent and a code environment, to which the machinery of reinforcement learning can be applied to obtain decoding agents. As a demonstration, by using deepQ learning, we obtain fast decoding agents for the surface code, for a variety of noise-models., Comment: 15 pages, 11 figures, associated code repository available at https://github.com/R-Sweke/DeepQ-Decoding

In this work we demonstrate that non-random mechanisms that lead to single-particle localization may also lead to many-body localization, even in the absence of disorder. In particular, we consider interacting spins and fermions in the presence of a linear potential. In the non-interacting limit, these models show the well known Wannier-Stark localization. We analyze the fate of this localization in the presence of interactions. Remarkably, we find that beyond a critical value of the potential gradient, these models exhibit non-ergodic behavior as indicated by their spectral and dynamical properties. These models, therefore, constitute a new class of generic non-random models that fail to thermalize. As such, they suggest new directions for experimentally exploring and understanding the phenomena of many-body localization. We supplement our work by showing that by employing machine learning techniques, the level statistics of a system may be calculated without generating and diagonalizing the Hamiltonian, which allows a generation of large statistics., Comment: 7 (main) + 3 (appendices) pages, 4 + 5 figures; Code and data available online

Entanglement plays an important role in our ability to understand, simulate, and harness quantum many-body phenomena. In this work, we investigate the entanglement spectrum for open one-dimensional systems, and propose a natural quantifier for how much a 1D quantum state is entangled while being subject to decoherence. We demonstrate our method using a simple case of single-particle evolution and find that the open system entanglement spectrum is composed of generalized concurrence values, as well as quantifiers of the state's purity. Our proposed entanglement spectrum can be directly obtained using a correct scaling of a matrix product state decomposition of the system's density matrix. Our method thus offers new observables that are easily acquired in the study of interacting 1D systems, and sheds light on the approximations employed in matrix product state simulations of open system dynamics., Comment: 7+2 pages

We show that a quantum many-body system may be controlled by means of Floquet engineering, i.e., their properties may be controlled and manipulated by employing periodic driving. We present a concrete driving scheme that allows control over the nature of mobile units and the amount of diffusion in generic many-body systems. We demonstrate these ideas for the Fermi-Hubbard model, where the drive renders doubly occupied sites (doublons) the mobile excitations in the system. In particular, we show that the amount of diffusion in the system and the level of fermion-pairing may be controlled and understood solely in terms of the doublon dynamics. We find that under certain circumstances the diffusion in the system may be eliminated completely. We conclude our work by generalizing these ideas to generic many-body systems., Comment: 10 pages, 5 figures

A defining feature of a symmetry protected topological phase (SPT) in one-dimension is the degeneracy of the Schmidt values for any given bipartition. For the system to go through a topological phase transition separating two SPTs, the Schmidt values must either split or cross at the critical point in order to change their degeneracies. A renormalization group (RG) approach based on this splitting or crossing is proposed, through which we obtain an RG flow that identifies the topological phase transitions in the parameter space. Our approach can be implemented numerically in an efficient manner, for example, using the matrix product state formalism, since only the largest first few Schmidt values need to be calculated with sufficient accuracy. Using several concrete models, we demonstrate that the critical points and fixed points of the RG flow coincide with the maxima and minima of the entanglement entropy, respectively, and the method can serve as a numerically efficient tool to analyze interacting SPTs in the parameter space., Comment: 5 pages, 3 figures

We propose the use of recurrent neural networks for classifying phases of matter based on the dynamics of experimentally accessible observables. We demonstrate this approach by training recurrent networks on the magnetization traces of two distinct models of one-dimensional disordered and interacting spin chains. The obtained phase diagram for a well-studied model of the many-body localization transition shows excellent agreement with previously known results obtained from time-independent entanglement spectra. For a periodically-driven model featuring an inherently dynamical time-crystalline phase, the phase diagram that our network traces in a previously-unexplored regime coincides with an order parameter for its expected phases., Comment: 5 pages + 3 fig, appendix + 5 fig

Experimental control over ultracold quantum gases has made it possible to investigate low-dimensional systems of both bosonic and fermionic atoms. In closed 1D systems there are a lot of similarities in the dynamics of local quantities for spinless fermions and strongly interacting "hard-core" bosons, which on a lattice can be formalised via a Jordan-Wigner transformation. In this study, we analyse the similarities and differences for spinless fermions and hard-core bosons on a lattice in the presence of particle loss. The removal of a single fermion causes differences in local quantities compared with the bosonic case, because of the different particle exchange symmetry in the two cases. We identify deterministic and probabilistic signatures of these dynamics in terms of local particle density, which could be measured in ongoing experiments with quantum gas microscopes., Comment: 7 pages, 6 figures

The classification of states of matter and their corresponding phase transitions is a special kind of machine-learning task, where physical data allow for the analysis of new algorithms, which have not been considered in the general computer-science setting so far. Here we introduce an unsupervised machine-learning scheme for detecting phase transitions with a pair of discriminative cooperative networks (DCN). In this scheme, a guesser network and a learner network cooperate to detect phase transitions from fully unlabeled data. The new scheme is efficient enough for dealing with phase diagrams in two-dimensional parameter spaces, where we can utilize an active contour model -- the snake -- from computer vision to host the two networks. The snake, with a DCN "brain", moves and learns actively in the parameter space, and locates phase boundaries automatically.

At long times residual couplings to the environment become relevant even in the most isolated experiments, creating a crucial difficulty for the study of fundamental aspects of many-body dynamics. A particular example is many-body localization in a cold-atom setting, where incoherent photon scattering introduces both dephasing and particle loss. Whereas dephasing has been studied in detail and is known to destroy localization already on the level of non-interacting particles, the effect of particle loss is less well understood. A difficulty arises due to the `non-local' nature of the loss process, complicating standard numerical tools using matrix product decomposition. Utilizing symmetries of the Lindbladian dynamics, we investigate the particle loss on both the dynamics of observables, as well as the structure of the density matrix and the individual states. We find that particle loss in the presence of interactions leads to dissipation and a strong suppression of the (operator space) entanglement entropy. Our approach allows for the study of the interplay of dephasing and loss for pure and mixed initial states to long times, which is important for future experiments using controlled coupling of the environment., Comment: 10 pages, 5 figures

Time periodic modulations of the transverse field in the closed XY spin-1/2 chain generate a very rich dynamical phase diagram, with a hierarchy of topological phases characterized by differing numbers of Floquet-Majorana modes. We show that this rich phase diagram survives when the system is coupled to dissipative end reservoirs. Circumventing the obstacle of preparing and measuring quasi energy configurations endemic to Floquet-Majorana detection schemes, we show that stroboscopic heat transport and spin density are robust observables to detect both the dynamical phase transitions and Majorana modes. In particular, we find that the derivative of the heat current, with respect to a control parameter, changes sign at the boundaries separating topological phases with different numbers of Floquet Majorana modes. We present a simple scheme to directly count the number of Floquet-Majorana modes in a phase from the Fourier transform of the local spin density profile. Our results are valid provided the anisotropies are not strong and can be easily implemented in quantum engineered systems., Comment: 5 pages, 3 figures

Classifying phases of matter is a central problem in physics. For quantum mechanical systems, this task can be daunting owing to the exponentially large Hilbert space. Thanks to the available computing power and access to ever larger data sets, classification problems are now routinely solved using machine learning techniques. Here, we propose to use a neural network based approach to find phase transitions depending on the performance of the neural network after training it with deliberately incorrectly labelled data. We demonstrate the success of this method on the topological phase transition in the Kitaev chain, the thermal phase transition in the classical Ising model, and the many-body-localization transition in a disordered quantum spin chain. Our method does not depend on order parameters, knowledge of the topological content of the phases, or any other specifics of the transition at hand. It therefore paves the way to a generic tool to identify unexplored phase transitions., Comment: 5 pages, 3 figures

We use an external spin as a dynamical probe of many body localization. The probe spin is coupled to an interacting and disordered environment described by a Heisenberg spin chain in a random field. The spin-chain environment can be tuned between a thermalizing delocalized phase and non-thermalizing localized phase, both in its ground- and high-energy states. We study the decoherence of the probe spin when it couples to the environment prepared in three states: the ground state, the infinite temperature state and a high energy N\'eel state. In the non-thermalizing many body localized regime, the coherence shows scaling behaviour in the disorder strength. The long-time dynamics of the probe spin shows a logarithmic dephasing in analogy with the logarithmic growth of entanglement entropy for a bi-partition of a many-body localized system. In summary, we show that decoherence of the probe spin provides clear signatures of many-body localization., Comment: 5 pages, 4 figures

We study the interplay of geometric frustration and interactions in a non-equilibrium photonic lattice system exhibiting a polariton flat band as described by a variant of the Jaynes-Cummings-Hubbard model. We show how to engineer strong photonic correlations in such a driven, dissipative system by quenching the kinetic energy through frustration. This produces an incompressible state of photons characterized by short-ranged crystalline order with period doubling. The latter manifests itself in strong spatial correlations, i.e., on-site and nearest-neighbor anti-bunching combined with extended density-wave oscillations at larger distances. We propose a state-of-the-art circuit QED realization of our system, which is tunable in situ., Comment: 5 pages, 5 figures

We show how to generalize the concepts of identifying and classifying symmetry protected topological phases in 1D to the case of an arbitrary mixed state. The pure state concepts are reviewed using a concrete spin-1 model. For the mixed state setup we demonstrate our findings numerically using matrix product state algorithms. Starting from the ground state and applying various types of noise sources we find a transient regime where the system is driven out of equilibrium while retaining its topological properties., Comment: 4 pages + appendix

We study a one-dimensional model of interacting bosons on a lattice with two flat bands. Regular condensation is suppressed due to the absence of a well defined minimum in the single particle spectrum. We find that interactions stabilize a number of non-trivial phases like a pair (quasi-) condensate, a supersolid at incommensurable fillings and valence bond crystals at commensurability. We support our analytical calculations with numerical simulations using the density matrix renormalization group technique. Implications for cold-atoms and extensions to higher dimensions are discussed., Comment: 4+ pages

We discuss the fine-tuning of the optical properties of self-assembled quantum dots by the strain perturbation introduced by laser-induced surface defects. We show experimentally that the quantum dot transition red-shifts, independently of the actual position of the defect, and that such frequency shift is about a factor five larger than the corresponding shift of a micropillar cavity mode resonance. We present a simple model that accounts for these experimental findings., Comment: 9 pages, 6 figures. To appear in Phys. Rev. B

We demonstrate a technique for achieving spectral resonance between a polarization-degenerate micropillar cavity mode and an embedded quantum dot transition. Our approach is based on a combination of isotropic and anisotropic tensile strain effected by laser-induced surface defects, thereby providing permanent tuning. Such a technique is a prerequisite for the implementation of scalable quantum information schemes based on solid-state cavity quantum electrodynamics., Comment: 3 pages, 3 figures