Searcharxiv⌕ Search

arXiv subjects

Michael A. Perlin

Publications and source records attributed to Michael A. Perlin.

32 records · Page 2Linked to original sources

A short note on effective Pauli noise models

We provide a simple prescription to extract an effective Pauli noise model from classical simulations of a noisy experimental protocol for a unitary gate. This prescription yields the closest Pauli channel approximation to the error channel associated with the gate implementation, as measured by the Frobenius distance between quantum channels. Informed by these results, we highlight some puzzles regarding the quantitative treatment of coherent errors.

quant-ph↗

Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation

Scaling the size of monolithic quantum computer systems is a difficult task. As the number of qubits within a device increases, a number of factors contribute to decreases in yield and performance. To meet this challenge, distributed architectures composed of many networked quantum computers have been proposed as a viable path to scalability. Such systems will need algorithms and compilers that are tailored to their distributed architectures. In this work we introduce the Quantum Divide and Conquer Algorithm (QDCA), a hybrid variational approach to mapping large combinatorial optimization problems onto distributed quantum architectures. This is achieved through the combined use of graph partitioning and quantum circuit cutting. The QDCA, an example of application-compiler co-design, alters the structure of the variational ansatz to tame the exponential compilation overhead incurred by quantum circuit cutting. The result of this cross-layer co-design is a highly flexible algorithm which can be tuned to the amount of classical or quantum computational resources that are available, and can be applied to both near- and long-term distributed quantum architectures. We simulate the QDCA on instances of the Maximum Independent Set problem and find that it is able to outperform similar classical algorithms. We also evaluate an 8-qubit QDCA ansatz on a superconducting quantum computer and show that circuit cutting can help to mitigate the effects of noise. Our work demonstrates how many small-scale quantum computers can work together to solve problems $85\%$ larger than their own qubit count, motivating the development and potential of large-scale distributed quantum computing.

quant-ph↗

Superstaq: Deep Optimization of Quantum Programs

We describe Superstaq, a quantum software platform that optimizes the execution of quantum programs by tailoring to underlying hardware primitives. For benchmarks such as the Bernstein-Vazirani algorithm and the Qubit Coupled Cluster chemistry method, we find that deep optimization can improve program execution performance by at least 10x compared to prevailing state-of-the-art compilers. To highlight the versatility of our approach, we present results from several hardware platforms: superconducting qubits (AQT @ LBNL, IBM Quantum, Rigetti), trapped ions (QSCOUT), and neutral atoms (Infleqtion). Across all platforms, we demonstrate new levels of performance and new capabilities that are enabled by deeper integration between quantum programs and the device physics of hardware.

quant-ph↗

Clifford-based Circuit Cutting for Quantum Simulation

Quantum computing has potential to provide exponential speedups over classical computing for many important applications. However, today's quantum computers are in their early stages, and hardware quality issues hinder the scale of program execution. Benchmarking and simulation of quantum circuits on classical computers is therefore essential to advance the understanding of how quantum computers and programs operate, enabling both algorithm discovery that leads to high-impact quantum computation and engineering improvements that deliver to more powerful quantum systems. Unfortunately, the nature of quantum information causes simulation complexity to scale exponentially with problem size. In this paper, we debut Super.tech's SuperSim framework, a new approach for high fidelity and scalable quantum circuit simulation. SuperSim employs two key techniques for accelerated quantum circuit simulation: Clifford-based simulation and circuit cutting. Through the isolation of Clifford subcircuit fragments within a larger non-Clifford circuit, resource-efficient Clifford simulation can be invoked, leading to significant reductions in runtime. After fragments are independently executed, circuit cutting and recombination procedures allow the final output of the original circuit to be reconstructed from fragment execution results. Through the combination of these two state-of-art techniques, SuperSim is a product for quantum practitioners that allows quantum circuit evaluation to scale beyond the frontiers of current simulators. Our results show that Clifford-based circuit cutting accelerates the simulation of near-Clifford circuits, allowing 100s of qubits to be evaluated with modest runtimes.

quant-ph↗

Enhancing spin squeezing using soft-core interactions

We propose a new protocol for preparing spin squeezed states in controllable atomic, molecular, and optical systems, with particular relevance to emerging optical clock platforms compatible with Rydberg interactions. By combining a short-ranged, soft-core potential with an external drive, we can transform naturally emerging Ising interactions into an XX spin model while opening a many-body gap. The gap helps maintain the system within a collective manifold of states where metrologically useful spin squeezing can be generated at a level comparable to the spin squeezing generated in systems with genuine all-to-all interactions. We examine the robustness of our protocol to experimentally-relevant decoherence and show favorable performance over typical protocols lacking gap protection.

quant-ph↗

Spin qudit tomography and state reconstruction error

We consider the task of performing quantum state tomography on a $d$-level spin qudit, using only measurements of spin projection onto different quantization axes. After introducing a basis of operators closely related to the spherical harmonics, which obey the rotational symmetries of spin qudits, we map our quantum tomography task onto the classical problem of signal recovery on the sphere. We then provide algorithms with $O(rd^3)$ serial runtime, parallelizable down to $O(rd^2)$, for (i) computing a priori upper bounds on the expected error with which spin projection measurements along $r$ given axes can reconstruct an unknown qudit state, and (ii) estimating a posteriori the statistical error in a reconstructed state. Our algorithms motivate a simple randomized tomography protocol, for which we find that using more measurement axes can yield substantial benefits that plateau after $r\approx3d$.

quant-ph↗

Engineering infinite-range SU($n$) interactions with spin-orbit-coupled fermions in an optical lattice

We study multilevel fermions in an optical lattice described by the Hubbard model with on site SU($n$)-symmetric interactions. We show that in an appropriate parameter regime this system can be mapped onto a spin model with all-to-all SU($n$)-symmetric couplings. Raman pulses that address internal spin states modify the atomic dispersion relation and induce spin-orbit coupling, which can act as a synthetic inhomogeneous magnetic field that competes with the SU($n$) exchange interactions. We investigate the mean-field dynamical phase diagram of the resulting model as a function of $n$ and different initial configurations that are accessible with Raman pulses. Consistent with previous studies for $n=2$, we find that for some initial states the spin model exhibits two distinct dynamical phases that obey simple scaling relations with $n$. Moreover, for $n>2$ we find that dynamical behavior can be highly sensitive to initial intra-spin coherences. Our predictions are readily testable in current experiments with ultracold alkaline-earth(-like) atoms.

cond-mat.quant-gas↗

Quantum Circuit Cutting with Maximum Likelihood Tomography

We introduce maximum likelihood fragment tomography (MLFT) as an improved circuit cutting technique for running clustered quantum circuits on quantum devices with a limited number of qubits. In addition to minimizing the classical computing overhead of circuit cutting methods, MLFT finds the most likely probability distribution for the output of a quantum circuit, given the measurement data obtained from the circuit's fragments. We demonstrate the benefits of MLFT for accurately estimating the output of a fragmented quantum circuit with numerical experiments on random unitary circuits. Finally, we show that circuit cutting can estimate the output of a clustered circuit with higher fidelity than full circuit execution, thereby motivating the use of circuit cutting as a standard tool for running clustered circuits on quantum hardware.

quant-ph↗

Spin squeezing with short-range spin-exchange interactions

We investigate many-body spin squeezing dynamics in an XXZ model with interactions that fall off with distance $r$ as $1/r^α$ in $D=2$ and $3$ spatial dimensions. In stark contrast to the Ising model, we find a broad parameter regime where spin squeezing comparable to the infinite-range $α=0$ limit is achievable even when interactions are short-ranged, $α>D$. A region of "collective" behavior in which optimal squeezing grows with system size extends all the way to the $α\to\infty$ limit of nearest-neighbor interactions. Our predictions, made using the discrete truncated Wigner approximation (DTWA), are testable in a variety of experimental cold atomic, molecular, and optical platforms.

quant-ph↗

Short-time expansion of Heisenberg operators in open collective quantum spin systems

We present a new method to compute short-time expectation values in large collective spin systems with generic Markovian decoherence. Our method is based on a Taylor expansion of a formal solution to the equations of motion for Heisenberg operators. This expansion can be truncated at finite order to obtain virtually exact results at short times that are relevant for metrological applications such as spin squeezing. In order to evaluate the expansion for Heisenberg operators, we compute the relevant structure constants of a collective spin operator algebra. We demonstrate the utility of our method by computing spin squeezing, two-time correlation functions, and out-of-time-ordered correlators for $10^4$ spins in strong-decoherence regimes that are otherwise inaccessible via existing numerical methods. Our method can be straightforwardly generalized to the case of a collective spin coupled to bosonic modes, relevant for trapped ion and cavity QED experiments, and may be used to investigate short-time signatures of quantum chaos and information scrambling.

quant-ph↗

Stochastic Approximation Monte Carlo with a Dynamic Update Factor

We present a new Monte Carlo algorithm based on the Stochastic Approximation Monte Carlo (SAMC) algorithm for directly calculating the density of states. The proposed method is Stochastic Approximation with a Dynamic update factor (SAD) which dynamically adjusts the update factor $γ_t$ during the course of the simulation. We test this method on the square-well fluid and the 31-atom Lennard-Jones cluster and compare the convergence behavior of several related Monte Carlo methods. We find that both the SAD and $1/t$-Wang-Landau ($1/t$-WL) methods rapidly converge to the correct density of states without the need for the user to specify an arbitrary tunable parameter $t_0$ as in the case of SAMC. SAD requires as input the temperature range of interest, in contrast to $1/t$-WL, which requires that the user identify the interesting range of energies. The convergence of the $1/t$-WL method is very sensitive to the energy range chosen for the low-temperature heat capacity of the Lennard-Jones cluster. Thus, SAD is more powerful in the common case in which the range of energies is not known in advance.

cond-mat.stat-mech↗

Quantum entropic self-localization with ultracold fermions

We study a driven, spin-orbit coupled fermionic system in a lattice at the resonant regime where the drive frequency equals the Hubbard repulsion, for which non-trivial constrained dynamics emerge at fast timescales. An effective density-dependent tunneling model is derived, and examined in the sparse filling regime in 1D. The system exhibits entropic self-localization, where while even numbers of atoms propagate ballistically, odd numbers form localized bound states induced by an effective attraction from a higher configurational entropy. These phenomena occur in the strong coupling limit where interactions only impose a constraint with no explicit Hamiltonian term. We show how the constrained dynamics lead to quantum few-body scars and map to an Anderson impurity model with an additional intriguing feature of non-reciprocal scattering. Connections to many-body scars and localization are also discussed.

quant-ph↗

Effective multi-body SU($N$)-symmetric interactions of ultracold fermionic atoms on a 3-D lattice

Rapid advancements in the experimental capabilities with ultracold alkaline-earth-like atoms (AEAs) bring to a surprisingly near term the prospect of performing quantum simulations of spin models and lattice field theories exhibiting SU($N$) symmetry. Motivated in particular by recent experiments preparing high density samples of strongly interacting ${}^{87}$Sr atoms in a three-dimensional optical lattice, we develop a low-energy effective theory of fermionic AEAs which exhibits emergent multi-body SU($N$)-symmetric interactions, where $N$ is the number of atomic nuclear spin levels. Our theory is limited to the experimental regime of (i) a deep lattice, with (ii) at most one atom occupying each nuclear spin state on any lattice site. The latter restriction is a consequence of initial ground-state preparation. We fully characterize the low-lying excitations in our effective theory, and compare predictions of many-body interaction energies with direct measurements of many-body excitation spectra in an optical lattice clock. Our work makes the first step in enabling a controlled, bottom-up experimental investigation of multi-body SU($N$) physics.

cond-mat.quant-gas↗

Noise-resilient architecture of a hybrid electron-nuclear quantum register in diamond

A hybrid quantum register consisting of nuclear spins in a solid-state platform coupled to a central electron spin is expected to combine the advantages of its elements. However, the potential to exploit long nuclear spin coherence times is severely limited by magnetic noise from the central electron spin during external interrogation. We overcome this obstacle and present protocols for addressing a decoherence-free nuclear spin subspace, which was not accessible by previously existing methods. We demonstrate the efficacy of our protocols using detailed numerical simulations of a nitrogen-vacancy centre with nearby $^{13}$C nuclei, and show that the resulting hybrid quantum register is immune to electron spin noise and external magnetic field drifts. Our work takes an important step toward realizing robust quantum registers that can be easily manipulated, entangled, and, at the same time, well isolated from external noise, with applications from quantum information processing and communication to quantum sensing.

quant-ph↗