Searcharxiv⌕ Search

arXiv subjects

Rahul Trivedi

Publications and source records attributed to Rahul Trivedi.

At least 19 recordsLinked to original sources

Efficient representations by PEPS: critical free-fermion and chiral topological states

We construct projected entangled-pair state (PEPS) approximations to various many-body states in 2D lattices with global error at most $ε$ and bond dimension polynomial in the system size and $1/ε$. They include critical free-fermion models in two dimensions, as well as chiral topological states. For the two-dimensional nearest-neighbor tight-binding model at half filling, our construction combines Gaussian wavelet transformations with matrix product state approximations of the one-dimensional chains, as well as selected fermionic swap operations. For arbitrary uniformly gapped, finite-range quadratic Hamiltonians, we give a different construction based on repeated one-particle filtering, which yields Gaussian PEPS in any spatial dimension. Those include, for instance, $p+ip$ models or a Chern-insulator in a square lattice, for which we give an explicit construction. Finally, we prove that Gutzwiller projections of a fixed number of identical Gaussian PEPS approximations to free-fermion states at arbitrary filling do not amplify considerably the approximation error. This provides a polynomial-bond PEPS approximations to the resulting states, including familiar lattice chiral-spin-liquid states.

quant-ph↗

Contractivity of time-dependent driven-dissipative systems

Experimentally relevant quantum systems are frequently described by a time-dependent Lindblad master equation in which the dissipation due to interaction with an environment is fixed, but the experimenter has control over the Hamiltonian, which therefore can change with time. A fundamental question that is also of practical relevance is to determine when such systems invariably lose information about their initial state (are exponentially contractive independent of the Hamiltonian) or when the control can be used to prevent this loss of information to some degree. Here, we identify the necessary and sufficient criterion on the dissipator for Hamiltonian-invariant contractivity. If the dissipator does not fulfil this criterion, but by itself is exponentially contractive, we also establish exponential contractivity for sufficiently weak or slow drives and construct examples where strong or fast driving prevents exponential contraction.

quant-ph↗

Measurement and feedforward circuits from quantum error correcting codes

Measurements and feedforward enhance the power of shallow quantum circuits, enabling the deterministic implementation of global unitary operations and the preparation of long-range entangled states. We establish a general correspondence between all such protocols and quantum error-correcting codes: the circuit preceding the measurements acts as an encoder, and unitary feedforward can eliminate post-selection if and only if the measurement projectors are detectable errors on the codespace. This correspondence provides a common framework for state preparation and implementation of global unitaries with measurements and feedforward, turning both into a code-design problem. For stabilizer codes with Pauli measurements, although the resulting operation can be non-Clifford, we show that its nonstabilizerness originates entirely from the encoder. We overcome this restriction using non-Pauli measurements or non-additive codes, constructing protocols that generate long-range nonstabilizerness while requiring only single-qubit unitary corrections.

quant-ph↗

Classical and Quantum Simulation of All-to-All Quantum Dynamics in Logarithmic Space

We study both the classical and the quantum complexity of the problem of estimating disorder-averaged quench dynamics for all-to-all spin Hamiltonians such as quantum Hopfield, Sherrington--Kirkpatrick (SK) or Dicke-type models. Disorder averaging restores permutation invariance in this setting, so states of $N$ spins can be stored in $\mathcal O(\log N)$ qubits. While logarithmic-space quantum computations are known to be simulatable classically in polynomial time or in polylogarithmic space, whether a single algorithm can achieve both is open, raising the possibility of simultaneous quantum advantage. To this end, we give a quantum algorithm for permutation-invariant $k$-local dynamics without disorder using polynomial time and $\mathcal O(\log N)$ quantum and classical space. We show that any classical algorithm matching these resources would imply $\mathsf{BQL}\subseteq \mathsf{SC}$. For short times, however, we provide such algorithms, including for SK models. For Hopfield models, we discuss how dilating the disorder to ancilla qubits reduces the problem to the disorder-free case on an enlarged system, thus extending both classical and quantum results to them. We give some evidence that their long-time dynamics are non-trivial. They thus emerge as a candidate for a simultaneous time--space advantage in quantum simulation.

quant-ph↗

Is rapid mixing stable?

Several physically interesting Lindbladians, such as those describing generic open quantum system models as well as engineered state preparation processes, are often rapidly mixing, that is, they relax to steady states in time scaling polylogarithmically with the system size. Owing to the short mixing times, it is physically expected that local perturbations do not substantially increase the mixing time. In this work we question this expectation and ask whether rapid mixing survives. We provide counterexamples showing that rapid mixing is not stable in general, even when the perturbation does not change the steady state. We also show that arbitrarily weak local Hamiltonian perturbations can destroy rapid mixing. Complementing these results, we develop an array of sufficient conditions which imply stable rapid mixing, including several classes of quasifree fermionic systems, commuting Lindbladians, and local spin systems. We also identify conditions under which modified logarithmic Sobolev inequalities (MLSIs), a stronger form of convergence, lead to stable rapid mixing. As a further implication of our results, we show that rapid mixing does not imply a positive MLSI constant.

quant-ph↗

Near-optimal quantum simulation of lattice Lindbladian dynamics

We consider the problem of simulating dynamics under geometrically local Lindbladians acting on a lattice of qudits. We present an algorithm to approximate the time evolution under these Lindbladians for evolution time $t$ and on $N$ qudits to diamond norm error $\varepsilon$ using geometrically local circuits of depth $O(t \ \polylog(Nt/\varepsilon))$. Our results thus achieve a performance comparable to that of the Haah-Hastings-Kothari-Low (HHKL) algorithm for lattice Hamiltonian simulation.

quant-ph↗

Quantum Memory and Autonomous Computation in Two Dimensions

Quantum error correction (QEC) normally requires active maintenance using measurements, classical processing and externally controlled correction schedules. Passive QEC, by contrast, was previously established only in unphysical spatial dimensions. Here, we give an explicit scheme for autonomous quantum error correction and computation in two dimensions, formulated as a dissipative quantum cellular automaton with a fixed, local and translation-invariant update rule. The construction uses hierarchical, self-simulating control elements based on ideas from the seminal classical results of Gács (1986, 1989) together with a measurement-free concatenated quantum code. We prove the existence of a nonzero noise threshold under a local noise model. Below this threshold, logical errors on encoded initial states are suppressed exponentially with increasing system size and the memory lifetime diverges in the thermodynamic limit. As an extension, we outline how this mechanism can also be implemented in continuous time by a time-independent, translation-invariant local Lindbladian. Quantum circuits can moreover be encoded in the automaton's initial state and executed fault-tolerantly with polylogarithmic overhead under the same circuit-independent rule. Our scheme thus realizes a self-correcting quantum computer capable of universal computation.

quant-ph↗

Light-cones in many-body open quantum systems with memory

Memory effects in many-body quantum systems interacting with an environment significantly impact their behavior. Nevertheless, much of our understanding of many-body open quantum systems is based on models within the Born-Markov approximation where these effects are neglected. In this paper, we consider a general class of spatially local open quantum lattice models with a non-Markovian environment that is approximated as Gaussian. Our main result is a set of Lieb-Robinson bounds for such models. For models where the environment has independent local baths, we show that the Lieb-Robinson velocity is controlled by one-norm of the memory kernel within the evolution time-interval, yielding a linear light cone whenever the memory kernel has a bounded one-norm. For models where excitations can propagate through the environment, we prove a polynomial light cone that captures bath-mediated acceleration of information spreading. In both of these cases, we show that the derived Lieb-Robinson bounds are tight by also constructing lattice models saturating these bounds. Finally, we consider the problem of approximating a non-Markovian model by a larger Markovian model, which contains the system spins together with only a finite number of bosonic environment modes. We establish that as a consequence of our Lieb-Robinson bounds, the number of environment modes {per system site} needed to accurately capture local observables is independent of the size of the system.

quant-ph↗

Structure and Classification of Matrix Product Quantum Channels

We develop a framework for Matrix Product Quantum Channels (MPQCs), a one-dimensional tensor-network description of completely positive, trace-preserving maps. We focus on translation-invariant channels, generated by a single repeated tensor, that admit a local purification. We show that their purifying isometry can always be implemented by a constant-depth brickwork quantum circuit, implying that such channels generate only short-range correlations when applied on product states. In contrast to the unitary setting, where one-dimensional quantum cellular automata (in one-to-one correspondence with matrix product unitaries) carry a nontrivial index, we prove that all locally purified channels belong to a single phase, that is, they can be continuously deformed into one another. We then extend the framework to a broader class of translation-invariant channels capable of generating long-range entanglement and show that these remain deterministically implementable in constant depth using two rounds of measurements and feedforward.

quant-ph↗

Sequential Measurements as a Resource in Ancilla-Assisted Quantum Metrology

We present a protocol for simultaneous estimation of both quadratures of a displacement channel on a quantum harmonic oscillator using a single ancilla qubit, without complex state preparation or adaptive control. The qubit is coupled to the quantum harmonic oscillator via controlled displacements of strength $A$ and undergoes $N$ rounds of measurement and reset, while the oscillator coherently accumulates the displacement signal. The non-commuting displacements imprint an order-dependent geometric phase at each round, giving a quantum Fisher information that scales as $\mathcal{O}(A^{2} N^{3})$. Although the measurement record space grows as $2^N$, we show that exact likelihoods for any individual measurement record can be computed in $\mathcal{O}(N^{2})$ time. With this, we show that measurement in the computational basis approximately saturates the quantum bound and maintains the $\mathcal{O}(A^2 N^3)$ scaling. Furthermore, the periodic information extraction makes the protocol robust to decoherence. Our results provide a framework for the design and analysis of sequential measurement in ancilla-assisted protocols.

quant-ph↗

Exact Many-body Quantum Dynamics in One-Dimensional Baths via Collective Spins

Computing the exact dynamics of many-body quantum systems becomes intractable as system size grows. Here, we present a symmetry-based method that provides an exponential reduction in the complexity of a broad class of such problems $\unicode{x2014}$ qubits coupled to one-dimensional electromagnetic baths. We identify conditions under which partial permutational symmetry emerges and exploit it to group qubits into collective multi-level degrees of freedom, which we term ''superspins.'' These superspins obey a generalized angular momentum algebra, reducing the relevant Hilbert space dimension from exponential to polynomial. Using this framework, we efficiently compute many-body superradiant dynamics in large arrays of qubits coupled to waveguides and ring resonators, showing that $\unicode{x2014}$ unlike in conventional Dicke superradiance $\unicode{x2014}$ the total spin length is not conserved. At long times, dark states become populated. We identify configurations where these states exhibit metrologically useful entanglement. Our approach enables exact treatment of complex dissipative dynamics beyond the fully symmetric limit and provides a rigorous benchmark for approximate numerical methods.

quant-ph↗

Dissipative preparation of injective tensor network states

The preparation of tensor network states is a fundamental prerequisite for a wide range of quantum simulation tasks. While many unitary protocols for preparing these states have been investigated, dissipative state preparation provides a powerful alternative since it can be robust to noise and initialization errors. In this paper, we construct both continuous-time and discrete-time geometrically local dissipative processes whose unique steady state is a given injective tensor network state. Our method prepares all injective matrix product states on $N$ sites to an error $\varepsilon$ in $O(\log (N/\varepsilon))$ time, yielding an exponential improvement over previously known dissipative preparation schemes. For two and higher-dimensional tensor network states, we prove that when the tensors of the state are \emph{highly injective}, the constructed dissipative processes are rapid-mixing i.e., they prepare a state $\varepsilon$-close to the $N$-site target state in $O( \log (N/\varepsilon))$ time. For these states, our approach provides a polynomial speedup over known unitary methods for states defined on lattices and an exponential speedup for states on general bounded-degree graphs. We corroborate our theoretical results with numerical studies that indicate that the dissipative protocol can rapidly prepares states outside the high-injectivity assumption.

quant-ph↗

The product structure of MPS-under-permutations

Tensor network methods have proved to be highly effective in addressing a wide variety of physical scenarios, including those lacking an intrinsic one-dimensional geometry. In such contexts, it is possible for the problem to exhibit a weak form of permutational symmetry, in the sense that entanglement behaves similarly across any arbitrary bipartition. In this paper, we show that translationally-invariant (TI) matrix product states (MPS) with this property are trivial, meaning that they are either product states or superpositions of a few of them. The results also apply to non-TI generic MPS, as well as further relevant examples of MPS including the W state and the Dicke states in an approximate sense. Our findings motivate the usage of ansätze simpler than tensor networks in systems whose structure is invariant under permutations.

quant-ph↗

Quantum Circuits for Matrix-Product Unitaries

Matrix-product unitaries (MPUs) are many-body unitary operators that, as a consequence of their tensor-network structure, preserve the entanglement area law in 1D systems. However, it is unknown how to implement an MPU as a quantum circuit since the individual tensors describing the MPU are not unitary. In this Letter, we show that a large class of MPUs can be implemented with a polynomial-depth quantum circuit. For an $N$-site MPU built from a repeated bulk tensor with open boundary, we explicitly construct a quantum circuit of polynomial depth $T = O(N^α)$ realizing the MPU, where the constant $α$ depends only on the bulk and boundary tensor and not the system size $N$. We show that this class includes nontrivial unitaries that generate long-range entanglement and, in particular, contains a large class of unitaries constructed from representations of $C^*$-weak Hopf algebras. Furthermore, we also adapt our construction to nonuniform translationally-varying MPUs and show that they can be implemented by a circuit of depth $O(N^β \, \mathrm{poly}\, D)$ where $β\le 1 + \log_2 \sqrt{D}/ s_{\min}$, with $D$ being the bond dimension and $s_{\min}$ the smallest nonzero Schmidt value of the normalized Choi state corresponding to the MPU.

quant-ph↗

Many-Body Entanglement in Solid-State Emitters

The preparation and control of quantum states lie at the heart of quantum information science (QIS). Recent advances in solid-state quantum emitters (QEs) and nanophotonics have transformed the landscape of quantum photonic technologies, enabling scalable generation of quantum states of light and matter. A new frontier in solid-state quantum photonics is the engineering of many-body interactions between QEs and photons to achieve robust coherence and controllable many-body entanglement. These entangled states, including photonic graph and cluster states, superradiant emission, and emergent quantum phases, are promising for quantum computation, sensing, and simulation. However, intrinsic inhomogeneities and decoherence in solid-state platforms pose significant challenges to realize such complex entangled states. This review provides an overview of the fundamental many-body interactions and dynamics at the light-matter interfaces of solid-state QEs, and discusses recent advances in mitigating decoherence and harnessing robust many-body coherence.

quant-ph↗

Efficiently learning non-Markovian noise in many-body quantum simulators

As quantum simulators are scaled up to larger system sizes and lower noise rates, non-Markovian noise channels are expected to become dominant. While provably efficient protocols for Markovian models of quantum simulators, either closed system models (described by a Hamiltonian) or open system models (described by a Lindbladian), have been developed, it remains less well understood whether similar protocols for non-Markovian models exist. In this paper, we consider geometrically local lattice models with both quantum and classical non-Markovian noise and show that, under a Gaussian assumption on the noise, we can learn the noise with sample complexity scaling logarithmically with the system size. Our protocol requires preparing the simulator qubits initially in a product state, introducing a layer of single-qubit Clifford gates and measuring product observables.

quant-ph↗

Dynamical complexity of non-Gaussian many-body systems with dissipation

We characterize the dynamical state of many-body bosonic and fermionic many-body models with inter-site Gaussian couplings, on-site non-Gaussian interactions and local dissipation comprising incoherent particle loss, particle gain, and dephasing. We first establish that, for fermionic systems, if the dephasing noise is larger than the non-Gaussian interactions, irrespective of the Gaussian coupling strength, the system state is a convex combination of Gaussian states at all times. Furthermore, for bosonic systems, we show that if the particle loss and particle gain rates are larger than the Gaussian inter-site couplings, the system remains in a separable state at all times. Building on this characterization, we establish that at noise rates above a threshold, there exists a classical algorithm that can efficiently sample from the system state of both the fermionic and bosonic models. Finally, we show that, unlike fermionic systems, bosonic systems can evolve into states that are not convex-Gaussian even when the dissipation is much higher than the on-site non-Gaussianity. Similarly, unlike bosonic systems, fermionic systems can generate entanglement even with noise rates much larger than the inter-site couplings.

quant-ph↗

Noise robustness of problem-to-simulator mappings for quantum many-body physics

Simulating quantum dynamics on digital or analog quantum simulators often requires ``problem-to-simulator" mappings such as trotterization, floquet-magnus expansion or perturbative expansions. When the simulator is noiseless, it is well understood that these problem-to-simulator mappings can be made as accurate as desired at the expense of simulator run-time. However, precisely because the simulator has to be run for a longer time to increase its accuracy, it is expected that noise in the quantum simulator catastrophically effects the simulator output. We show that, contrary to this expectation, these mappings remain stable to noise when considering the task of simulating dynamics of local observables in quantum lattice models. Specifically, we prove that in all of these mappings, local observables can be determined to a system-size independent, precision that scales sublinearly with the noise-rate in the simulator. Our results provide theoretical evidence that quantum simulators can be used for solving problems in many-body physics without or with modest error correction.

quant-ph↗