Searcharxiv⌕ Search

arXiv subjects

Alireza Seif

Publications and source records attributed to Alireza Seif.

At least 55 records · Page 3Linked to original sources

Perspectives on adaptive dynamical systems

Adaptivity is a dynamical feature that is omnipresent in nature, socio-economics, and technology. For example, adaptive couplings appear in various real-world systems like the power grid, social, and neural networks, and they form the backbone of closed-loop control strategies and machine learning algorithms. In this article, we provide an interdisciplinary perspective on adaptive systems. We reflect on the notion and terminology of adaptivity in different disciplines and discuss which role adaptivity plays for various fields. We highlight common open challenges, and give perspectives on future research directions, looking to inspire interdisciplinary approaches.

nlin.AO↗

Simple master equations for describing driven systems subject to classical non-Markovian noise

Driven quantum systems subject to non-Markovian noise are typically difficult to model even if the noise is classical. We present a systematic method based on generalized cumulant expansions for deriving a time-local master equation for such systems. This master equation has an intuitive form that directly parallels a standard Lindblad equation, but contains several surprising features: the combination of driving and non-Markovianity results in effective time-dependent dephasing rates that can be negative, and the noise can generate Hamiltonian renormalizations even though it is classical. We analyze in detail the highly relevant case of a Rabi-driven qubit subject to various kinds of non-Markovian noise including $1/f$ fluctuations, finding an excellent agreement between our master equation and numerically-exact simulations over relevant timescales. The approach outlined here is more accurate than commonly employed phenomenological master equations which ignore the interplay between driving and noise.

quant-ph↗

The learnability of Pauli noise

Recently, several quantum benchmarking algorithms have been developed to characterize noisy quantum gates on today's quantum devices. A well-known issue in benchmarking is that not everything about quantum noise is learnable due to the existence of gauge freedom, leaving open the question of what information about noise is learnable and what is not, which has been unclear even for a single CNOT gate. Here we give a precise characterization of the learnability of Pauli noise channels attached to Clifford gates, showing that learnable information corresponds to the cycle space of the pattern transfer graph of the gate set, while unlearnable information corresponds to the cut space. This implies the optimality of cycle benchmarking, in the sense that it can learn all learnable information about Pauli noise. We experimentally demonstrate noise characterization of IBM's CNOT gate up to 2 unlearnable degrees of freedom, for which we obtain bounds using physical constraints. In addition, we give an attempt to characterize the unlearnable information by assuming perfect initial state preparation. However, based on the experimental data, we conclude that this assumption is inaccurate as it yields unphysical estimates, and we obtain a lower bound on state preparation noise.

quant-ph↗

Distributed quantum error correction for chip-level catastrophic errors

Quantum error correction holds the key to scaling up quantum computers. Cosmic ray events severely impact the operation of a quantum computer by causing chip-level catastrophic errors, essentially erasing the information encoded in a chip. Here, we present a distributed error correction scheme to combat the devastating effect of such events by introducing an additional layer of quantum erasure error correcting code across separate chips. We show that our scheme is fault tolerant against chip-level catastrophic errors and discuss its experimental implementation using superconducting qubits with microwave links. Our analysis shows that in state-of-the-art experiments, it is possible to suppress the rate of these errors from 1 per 10 seconds to less than 1 per month.

quant-ph↗

Tailored XZZX codes for biased noise

Quantum error correction (QEC) for generic errors is challenging due to the demanding threshold and resource requirements. Interestingly, when physical noise is biased, we can tailor our QEC schemes to the noise to improve performance. Here we study a family of codes having XZZX-type stabilizer generators, including a set of cyclic codes generalized from the five-qubit code and a set of topological codes that we call generalized toric codes (GTCs). We show that these XZZX codes are highly qubit efficient if tailored to biased noise. To characterize the code performance, we use the notion of effective distance, which generalizes code distance to the case of biased noise and constitutes a proxy for the logical failure rate. We find that the XZZX codes can achieve a favorable resource scaling by this metric under biased noise. We also show that the XZZX codes have remarkably high thresholds that reach what is achievable by random codes, and furthermore they can be efficiently decoded using matching decoders. Finally, by adding only one flag qubit, the XZZX codes can realize fault-tolerant QEC while preserving their large effective distance. In combination, our results show that tailored XZZX codes give a resource-efficient scheme for fault-tolerant QEC against biased noise.

quant-ph↗

Shadow Distillation: Quantum Error Mitigation with Classical Shadows for Near-Term Quantum Processors

Mitigating errors in quantum information processing devices is especially important in the absence of fault tolerance. An effective method in suppressing state-preparation errors is using multiple copies to distill the ideal component from a noisy quantum state. Here, we use classical shadows and randomized measurements to circumvent the need for coherent access to multiple copies at an exponential cost. We study the scaling of resources using numerical simulations and find that the overhead is still favorable compared to full state tomography. We optimize measurement resources under realistic experimental constraints and apply our method to an experiment preparing Greenberger-Horne-Zeilinger (GHZ) state with trapped ions. In addition to improving stabilizer measurements, the analysis of the improved results reveals the nature of errors affecting the experiment. Hence, our results provide a directly applicable method for mitigating errors in near-term quantum computers.

quant-ph↗

Surviving The Barren Plateau in Variational Quantum Circuits with Bayesian Learning Initialization

Variational quantum-classical hybrid algorithms are seen as a promising strategy for solving practical problems on quantum computers in the near term. While this approach reduces the number of qubits and operations required from the quantum machine, it places a heavy load on a classical optimizer. While often under-appreciated, the latter is a computationally hard task due to the barren plateau phenomenon in parameterized quantum circuits. The absence of guiding features like gradients renders conventional optimization strategies ineffective as the number of qubits increases. Here, we introduce the fast-and-slow algorithm, which uses Bayesian Learning to identify a promising region in parameter space. This is used to initialize a fast local optimizer to find the global optimum point efficiently. We illustrate the effectiveness of this method on the Bars-and-Stripes (BAS) quantum generative model, which has been studied on several quantum hardware platforms. Our results move variational quantum algorithms closer to their envisioned applications in quantum chemistry, combinatorial optimization, and quantum simulation problems.

quant-ph↗

Distinguishing between quantum and classical Markovian dephasing dissipation

Understanding whether dissipation in an open quantum system is truly quantum is a question of both fundamental and practical interest. We consider n qubits subject to correlated Markovian dephasing and present a sufficient condition for when bath-induced dissipation can generate system entanglement and hence must be considered quantum. Surprisingly, we find that the presence or absence of time-reversal symmetry plays a crucial role: broken time-reversal symmetry is required for dissipative entanglement generation. Further, simply having nonzero bath susceptibilities is not enough for the dissipation to be quantum. We also present an explicit experimental protocol for identifying truly quantum dephasing dissipation and lay the groundwork for studying more complex dissipative systems and finding optimal noise mitigating strategies.

quant-ph↗

Quantum advantages for Pauli channel estimation

We show that entangled measurements provide an exponential advantage in sample complexity for Pauli channel estimation, which is both a fundamental problem and a practically important subroutine for benchmarking near-term quantum devices. The specific task we consider is to simultaneously learn all the eigenvalues of an $n$-qubit Pauli channel to $\pm\varepsilon$ precision. We give an estimation protocol with an $n$-qubit ancilla that succeeds with high probability using only $O(n/\varepsilon^{2})$ copies of the Pauli channel, while prove that any ancilla-free protocol (possibly with adaptive control and channel concatenation) would need at least $Ω(2^{n/3})$ rounds of measurement. We further study the advantages provided by a small number of ancillas. For the case that a $k$-qubit ancilla ($k\le n$) is available, we obtain a sample complexity lower bound of $Ω(2^{(n-k)/3})$ for any non-concatenating protocol, and a stronger lower bound of $Ω(n2^{n-k})$ for any non-adaptive, non-concatenating protocol, which is shown to be tight. We also show how to apply the ancilla-assisted estimation protocol to a practical quantum benchmarking task in a noise-resilient and sample-efficient manner, given reasonable noise assumptions. Our results provide a practically-interesting example for quantum advantages in learning and also bring new insight for quantum benchmarking.

quant-ph↗

Discovering hydrodynamic equations of many-body quantum systems

Simulating and predicting dynamics of quantum many-body systems is extremely challenging, even for state-of-the-art computational methods, due to the spread of entanglement across the system. However, in the long-wavelength limit, quantum systems often admit a simplified description, which involves a small set of physical observables and requires only a few parameters such as sound velocity or viscosity. Unveiling the relationship between these hydrodynamic equations and the underlying microscopic theory usually requires a great effort by condensed matter theorists. In the present paper, we develop a new machine-learning framework for automated discovery of effective equations from a limited set of available data, thus bypassing complicated analytical derivations. The data can be generated from numerical simulations or come from experimental quantum simulator platforms. Using integrable models, where direct comparisons can be made, we reproduce previously known hydrodynamic equations, strikingly discover novel equations and provide their derivation whenever possible. We discover new hydrodynamic equations describing dynamics of interacting systems, for which the derivation remains an outstanding challenge. Our approach provides a new interpretable method to study properties of quantum materials and quantum simulators in non-perturbative regimes.

quant-ph↗

Engineering an Effective Three-spin Hamiltonian in Trapped-ion Systems for Applications in Quantum Simulation

Trapped-ion quantum simulators, in analog and digital modes, are considered a primary candidate to achieve quantum advantage in quantum simulation and quantum computation. The underlying controlled ion-laser interactions induce all-to-all two-spin interactions via the collective modes of motion through Cirac-Zoller or Molmer-Sorensen schemes, leading to effective two-spin Hamiltonians, as well as two-qubit entangling gates. In this work, the Molmer-Sorensen scheme is extended to induce three-spin interactions via tailored first- and second-order spin-motion couplings. The scheme enables engineering single-, two-, and three-spin interactions, and can be tuned via an enhanced protocol to simulate purely three-spin dynamics. Analytical results for the effective evolution are presented, along with detailed numerical simulations of the full dynamics to support the accuracy and feasibility of the proposed scheme for near-term applications. With a focus on quantum simulation, the advantage of a direct analog implementation of three-spin dynamics is demonstrated via the example of matter-gauge interactions in the U(1) lattice gauge theory within the quantum link model. The mapping of degrees of freedom and strategies for scaling the three-spin scheme to larger systems, are detailed, along with a discussion of the expected outcome of the simulation of the quantum link model given realistic fidelities in the upcoming experiments. The applications of the three-spin scheme go beyond the lattice gauge theory example studied here and include studies of static and dynamical phase diagrams of strongly interacting condensed-matter systems modeled by two- and three-spin Hamiltonians.

quant-ph↗

Decoding conformal field theories: from supervised to unsupervised learning

We use machine learning to classify rational two-dimensional conformal field theories. We first use the energy spectra of these minimal models to train a supervised learning algorithm. We find that the machine is able to correctly predict the nature and the value of critical points of several strongly correlated spin models using only their energy spectra. This is in contrast to previous works that use machine learning to classify different phases of matter, but do not reveal the nature of the critical point between phases. Given that the ground-state entanglement Hamiltonian of certain topological phases of matter is also described by conformal field theories, we use supervised learning on Réyni entropies and find that the machine is able to identify which conformal field theory describes the entanglement Hamiltonian with only the lowest few Réyni entropies to a high degree of accuracy. Finally, using autoencoders, an unsupervised learning algorithm, we find a hidden variable that has a direct correlation with the central charge and discuss prospects for using machine learning to investigate other conformal field theories, including higher-dimensional ones. Our results highlight that machine learning can be used to find and characterize critical points and also hint at the intriguing possibility to use machine learning to learn about more complex conformal field theories.

cond-mat.str-el↗

Compressed Sensing Measurement of Long-Range Correlated Noise

Long-range correlated errors can severely impact the performance of NISQ (noisy intermediate-scale quantum) devices, and fault-tolerant quantum computation. Characterizing these errors is important for improving the performance of these devices, via calibration and error correction, and to ensure correct interpretation of the results. We propose a compressed sensing method for detecting two-qubit correlated dephasing errors, assuming only that the correlations are sparse (i.e., at most s pairs of qubits have correlated errors, where s << n(n-1)/2, and n is the total number of qubits). In particular, our method can detect long-range correlations between any two qubits in the system (i.e., the correlations are not restricted to be geometrically local). Our method is highly scalable: it requires as few as m = O(s log n) measurement settings, and efficient classical postprocessing based on convex optimization. In addition, when m = O(s log^4(n)), our method is highly robust to noise, and has sample complexity O(max(n,s)^2 log^4(n)), which can be compared to conventional methods that have sample complexity O(n^3). Thus, our method is advantageous when the correlations are sufficiently sparse, that is, when s < O(n^(3/2) / log^2(n)). Our method also performs well in numerical simulations on small system sizes, and has some resistance to state-preparation-and-measurement (SPAM) errors. The key ingredient in our method is a new type of compressed sensing measurement, which works by preparing entangled Greenberger-Horne-Zeilinger states (GHZ states) on random subsets of qubits, and measuring their decay rates with high precision.

quant-ph↗

Meta Hamiltonian Learning

Efficient characterization of quantum devices is a significant challenge critical for the development of large scale quantum computers. We consider an experimentally motivated situation, in which we have a decent estimate of the Hamiltonian, and its parameters need to be characterized and fine-tuned frequently to combat drifting experimental variables. We use a machine learning technique known as meta-learning to learn a more efficient optimizer for this task. We consider training with the nearest-neighbor Ising model and study the trained model's generalizability to other Hamiltonian models and larger system sizes. We observe that the meta-optimizer outperforms other optimization methods in average loss over test samples. This advantage follows from the meta-optimizer being less likely to get stuck in local minima, which highly skews the distribution of the final loss of the other optimizers. In general, meta-learning decreases the number of calls to the experiment and reduces the needed classical computational resources.

quant-ph↗

Entanglement entropy scaling transition under competing monitoring protocols

Dissipation generally leads to the decoherence of a quantum state. In contrast, numerous recent proposals have illustrated that dissipation can also be tailored to stabilize many-body entangled quantum states. While the focus of these works has been primarily on engineering the non-equilibrium steady state, we investigate the build-up of entanglement in the quantum trajectories. Specifically, we analyze the competition between two different dissipation channels arising from two incompatible continuous monitoring protocols. The first protocol locks the phase of neighboring sites upon registering a quantum jump, thereby generating a long-range entanglement through the system, while the second destroys the coherence via a dephasing mechanism. By studying the unraveling of stochastic quantum trajectories associated with the continuous monitoring protocols, we present a transition for the scaling of the averaged trajectory entanglement entropies, from critical scaling to area-law behavior. Our work provides an alternative perspective on the measurement-induced phase transition: the measurement can be viewed as monitoring and registering quantum jumps, offering an intriguing extension of these phase transitions through the long-established realm of quantum optics.

quant-ph↗

Optimal control for quantum detectors

Quantum systems are promising candidates for sensing of weak signals as they can provide unrivaled performance when estimating parameters of external fields. However, when trying to detect weak signals that are hidden by background noise, the signal-to-noise-ratio is a more relevant metric than raw sensitivity. We identify, under modest assumptions about the statistical properties of the signal and noise, the optimal quantum control to detect an external signal in the presence of background noise using a quantum sensor. Interestingly, for white background noise, the optimal solution is the simple and well-known spin-locking control scheme. We further generalize, using numerical techniques, these results to the background noise being a correlated Lorentzian spectrum. We show that for increasing correlation time, pulse based sequences such as CPMG are also close to the optimal control for detecting the signal, with the crossover dependent on the signal frequency. These results show that an optimal detection scheme can be easily implemented in near-term quantum sensors without the need for complicated pulse shaping.

quant-ph↗

Machine learning the thermodynamic arrow of time

The mechanism by which thermodynamics sets the direction of time's arrow has long fascinated scientists. Here, we show that a machine learning algorithm can learn to discern the direction of time's arrow when provided with a system's microscopic trajectory as input. The performance of our algorithm matches fundamental bounds predicted by nonequilibrium statistical mechanics. Examination of the algorithm's decision-making process reveals that it discovers the underlying thermodynamic mechanism and the relevant physical observables. Our results indicate that machine learning techniques can be used to study systems out of equilibrium, and ultimately to uncover physical principles.

cond-mat.stat-mech↗

Towards analog quantum simulations of lattice gauge theories with trapped ions

Gauge field theories play a central role in modern physics and are at the heart of the Standard Model of elementary particles and interactions. Despite significant progress in applying classical computational techniques to simulate gauge theories, it has remained a challenging task to compute the real-time dynamics of systems described by gauge theories. An exciting possibility that has been explored in recent years is the use of highly-controlled quantum systems to simulate, in an analog fashion, properties of a target system whose dynamics are difficult to compute. Engineered atom-laser interactions in a linear crystal of trapped ions offer a wide range of possibilities for quantum simulations of complex physical systems. Here, we devise practical proposals for analog simulation of simple lattice gauge theories whose dynamics can be mapped onto spin-spin interactions in any dimension. These include 1+1D quantum electrodynamics, 2+1D Abelian Chern-Simons theory coupled to fermions, and 2+1D pure Z2 gauge theory. The scheme proposed, along with the optimization protocol applied, will have applications beyond the examples presented in this work, and will enable scalable analog quantum simulation of Heisenberg spin models in any number of dimensions and with arbitrary interaction strengths.

quant-ph↗