Hyejin Kim, Yiqing Zhou, Yichen Xu, Kaarthik Varma, Amir H. Karamlou, Ilan T. Rosen, Jesse C. Hoke, Chao Wan, Jin Peng Zhou, William D. Oliver, Yuri D. Lensky, Kilian Q. Weinberger, Eun-Ah Kim
The imminent era of error-corrected quantum computing demands robust methods to characterize quantum state complexity from limited, noisy measurements. We introduce the Quantum Attention Network (QuAN), a classical artificial intelligence (AI) framework leveraging attention mechanisms tailored for learning quantum complexity. Inspired by large language models, QuAN treats measurement snapshots as tokens while respecting permutation invariance. Combined with our parameter-efficient miniset self-attention block, this enables QuAN to access high-order moments of bit-string distributions and preferentially attend to less noisy snapshots. We test QuAN across three quantum simulation settings: driven hard-core Bose-Hubbard model, random quantum circuits, and toric code under coherent and incoherent noise. QuAN directly learns entanglement and state complexity growth from experimental computational basis measurements, including complexity growth in random circuits from noisy data. In regimes inaccessible to existing theory, QuAN unveils the complete phase diagram for noisy toric code data as a function of both noise types, highlighting AI's transformative potential for assisting quantum hardware.
The imminent era of error-corrected quantum computing demands robust methods to characterize quantum state complexity from limited, noisy measurements. We introduce the Quantum Attention Network (QuAN), a classical artificial intelligence (AI) framework leveraging attention mechanisms tailored for learning quantum complexity. Inspired by large language models, QuAN treats measurement snapshots as tokens while respecting permutation invariance. Combined with our parameter-efficient miniset self-attention block, this enables QuAN to access high-order moments of bit-string distributions and preferentially attend to less noisy snapshots. We test QuAN across three quantum simulation settings: driven hard-core Bose-Hubbard model, random quantum circuits, and toric code under coherent and incoherent noise. QuAN directly learns entanglement and state complexity growth from experimental computational basis measurements, including complexity growth in random circuits from noisy data. In regimes inaccessible to existing theory, QuAN unveils the complete phase diagram for noisy toric code data as a function of both noise types, highlighting AI's transformative potential for assisting quantum hardware.
Measurement-induced phase transitions (MIPTs) epitomize new intellectual pursuits inspired by the advent of quantum hardware and the emergence of discrete and programmable circuit dynamics. Nevertheless, experimentally observing this transition is challenging, often requiring non-scalable protocols, such as post-selecting measurement trajectories or relying on classical simulations. We introduce a scalable data-centric approach using Quantum Attention Networks (QuAN) to detect MIPTs without requiring post-selection or classical simulation. Applying QuAN to dynamics generated by Haar random unitaries and weak measurements, we first demonstrate that it can pinpoint MIPTs using their interpretation as "learnability" transitions, where it becomes possible to distinguish two different initial states from the measurement record, locating a phase boundary consistent with exact results. Motivated by sample efficiency, we consider an alternative "phase recognition" task-classifying weak- and strong-monitoring data generated from a single initial state. We find QuAN can provide an efficient and noise-tolerant upper bound on the MIPT based on measurement data alone by coupling Born-distribution-level (inter-trajectory) and dynamical (temporal) attention. In particular, our inspection of the inter-trajectory scores of the model trained with minimal sample size processing test data confirmed that QuAN paid special attention to the tail of the distribution of the Born probabilities at early times. This reassuring interpretation of QuAN's learning implies the phase-recognition approach can meaningfully signal MIPT in an experimentally accessible manner. Our results lay the groundwork for observing MIPT on near-term quantum hardware and highlight attention-based architectures as powerful tools for learning complex quantum dynamics.
Transformer now underpins modern AI as its core infrastructure. Its defining capability-dynamically focusing on the most relevant information in complex inputs-is bounded above by the self-attention scoring function. Quantum computing, with its superposition, entanglement, and probabilistic outputs, offers a fundamentally distinct computational framework for exploring beyond the design constraints of classical scoring functions. While quantum attention mechanisms have shown initial promise, existing works remain largely confined to redefining feature similarity measures, leaving the systematic use of parameterized quantum circuits (PQCs) as scoring functions largely unexplored; a substantial portion of existing schemes further rely on purely quantum architectures, precluding effective encoding of high-dimensional image inputs in the Noisy Intermediate-Scale Quantum era. We propose the Quantum Parameterized Self-Attention Network (QPSAN), implementing the self-attention scoring function via PQCs with only 5 trainable quantum parameters per layer. QPSAN computes query-key attention scores through quantum state encoding and joint measurement, yielding naturally bounded outputs without the explicit scaling of classical dot-product attention. We further establish a theoretical framework of the mathematical properties of this scoring function, demonstrating its potential to capture complex nonlinear query-key interactions, and quantifying the structural constraints of the encoding layer via effective degrees of freedom analysis. Experiments on four vision datasets show that QPSAN significantly outperforms the Vision Transformer (ViT) baseline, with the quantum representational advantage amplifying as data complexity increases. Ablation studies indicate that the performance gains may stem from the structural inductive bias of the quantum circuit rather than from parameter scale.
The simulation of quantum matter with classical hardware plays a central role in the discovery and development of quantum many-body systems, with far-reaching implications in condensed matter physics and quantum technologies. In general, efficient and sophisticated algorithms are required to overcome the severe challenge posed by the exponential scaling of the Hilbert space of quantum systems. In contrast, hardware built with quantum bits of information are inherently capable of efficiently finding solutions of quantum many-body problems. While a universal and scalable quantum computer is still beyond the horizon, recent advances in qubit manufacturing and coherent control of synthetic quantum matter are leading to a new generation of intermediate scale quantum hardware. \n \nThe complexity underlying quantum many-body systems closely resembles the one encountered in many problems in the world of information and technology. In both contexts, the complexity stems from a large number of interacting degrees of freedom. A powerful strategy in the latter scenario is machine learning, a subfield of artificial intelligence where large amounts of data are used to extract relevant features and patterns. In particular, artificial neural networks have been demonstrated to be capable of discovering low-dimensional representations of complex objects from high-dimensional dataset, leading to the profound technological revolution we all witness in our daily life. \n \nIn this Thesis, we envision a new paradigm for scientific discovery in quantum physics. On the one hand, we have the essentially unlimited data generated with the increasing amount of highly controllable quantum hardware. On the other hand, we have a set of powerful algorithms that efficiently capture non-trivial correlations from high-dimensional data. Therefore, we fully embrace this data-driven approach to quantum mechanics, and anticipate new exciting possibilities in the field of quantum many-body physics and quantum information science. We revive a powerful stochastic neural network called a restricted Boltzmann machine, which slowly moved out of fashion after playing a central role in the machine learning revolution of the early 2010s. We introduce a neural-network representation of quantum states based on this generative model. We propose a set of algorithms to reconstruct unknown quantum states from measurement data and numerically demonstrate their potential, with important implications for current experiments. These include the reconstruction of experimentally inaccessible properties, such as entanglement, and diagnostics to determine sources of noise. Furthermore, we introduce a machine learning framework for quantum error correction, where a neural network learns the best decoding strategy directly from data. We expect that the full integration between quantum hardware and artificial intelligence will become the gold standard, and will drive the world into the era of fault-tolerant quantum computing and large-scale quantum simulations.
This article proposes a quantum self-attention neural network (QSAN) model that is implementable on parameterized quantum circuits (PQCs), providing a novel avenue for addressing natural language processing (NLP) tasks via quantum computing. The QSAN architecture comprises four blocks: the data preprocessing block, the quantum encoding block, the model design block, and the network optimization block. Through these blocks, classical text data are initially preprocessed and encoded into quantum states. The rich semantic features and intricate relationships within these quantum states are then captured and learned by a quantum self-attention layer and a quantum fully connected layer. Finally, the model performance is enhanced by optimizing the network parameters. Simulation results on publicly available topic classification and sentiment analysis datasets demonstrate that the QSAN model outperforms state-of-the-art baselines. As a limitation of the current study, these evaluations are restricted to a maximum sentence length of eight words due to simulation and hardware constraints. Moreover, the effectiveness, scalability, trainability, and robustness of the proposed model are comprehensively evaluated, highlighting its superior performance and potential for advanced NLP tasks.
Quantum-Inspired Transformers are a new class of approaches for natural language processing (NLP) that use principles inspired by physical quantum mechanics to encode and process linguistic information. Paper aims to improve both scalability and efficiency for large-scale NLP tasks in the next generation of artificial intelligence (AI). However, traditional transformers can struggle to encode complex semantic relationships across long sequences and can require high levels of compute resources, hence limiting scalability for large datasets and multilingual tasks. In addition, traditional embeddings do not represent multiple contextual meanings simultaneously, which decreases model expressiveness. To address these challenges and maximize the exploration of potential quantum effects in AI, this paper presents a Quantum State Embedding Attention (QSEA) framework that encodes tokens as quantum inspired states with complex-valued amplitudes. Attention, which is based on entangled states, is meant to efficiently capture long-range dependencies while reducing compute and increasing scalability, all without losing a rich understanding of context. Whereas multilingual translation needs to encode both the source similarity and the target language within a smaller semantic representation space. Our experimentation shows that QSEA consistently provides increased accuracy in decoding, measures attention across long sequences, and yields enduring scalability over large multilingual datasets. The evidence demonstrates the potential for QSEA to be the new layer in the future of AI systems, a layer that is scalable and a highperforming NLP application.
Quantum neural networks generalize classical artificial neural networks into the quantum domain. They are formulated as parameterized quantum circuits which are optimized by measuring and minimizing a suitably chosen loss function. The core challenge in understanding, implementing and ultimately using quantum neural networks is that they represent many-body systems with an exponentially large Hilbert space, in combination with a large parameter search space. Moreover, noise -- which is inherent to any quantum measurement -- sets practical limits for the estimation of training loss. Here, we study physics-informed large-scale quantum neural networks that are trained through a finite number of noisy loss function measurements. We show that this architecture permits the construction of nontrivial decision boundaries that enable the classification of quantum states through measuring an order parameter. Our approach can directly process quantum data that is output from quantum simulators and computers and is well suited for implementation on current hardware. Moreover, owed to a close link between the neural network dynamics and the evolution of Markovian open many-body quantum systems, one may expect a certain robustness to noise, which is ubiquitous in the current NISQ era.