arXiv subjects

Rahul Trivedi

Publications and source records attributed to Rahul Trivedi.

At least 19 recordsLinked to original sources

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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. 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↗

arXiv2026

Contractivity of time-dependent driven-dissipative systems

In a number of physically relevant contexts, a quantum system interacting with a decohering environment is simultaneously subjected to time-dependent controls and its dynamics is thus described by a time-dependent Lindblad master equation. Of particular interest in such systems is to understand the circumstances in which, despite the ability to apply time-dependent controls, they lose information about their initial state exponentially with time i.e., their dynamics are exponentially contractive. While there exists an extensive framework to study contractivity for time-independent Lindbladians, their time-dependent counterparts are far less well understood. In this paper, we study the contractivity of Lindbladians, which have a fixed dissipator (describing the interaction with an environment), but with a time-dependent driving Hamiltonian. We establish exponential contractivity in the limit of sufficiently small or sufficiently slow drives together with explicit examples showing that, even when the fixed dissipator is exponentially contractive by itself, a sufficiently large or a sufficiently fast Hamiltonian can result in non-contractive dynamics. Furthermore, we provide a number of sufficient conditions on the fixed dissipator that imply exponential contractivity independently of the Hamiltonian. These sufficient conditions allow us to completely characterize Hamiltonian-independent contractivity for unital dissipators and for two-level systems.

quant-ph↗

arXiv2026

Quantum Memory and Autonomous Computation in Two Dimensions

Standard approaches to quantum error correction (QEC) require active maintenance using measurements and classical processing. Passive QEC, by contrast, has so far been 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\'acs (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. We also describe an implementation in continuous time as a time-independent, translation-invariant local Lindbladian using engineered dissipative jump operators. The recursive nature of our protocol allows for the fault-tolerant execution of quantum circuits specified by the initial state, and thus constitutes a self-correcting quantum computer capable of universal computation.

quant-ph↗

arXiv2025

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↗

arXiv2025

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↗

arXiv2025

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↗

arXiv2025

Optimizing digital quantum simulation of open quantum lattice models

Many-body systems arising in condensed matter physics and quantum optics inevitably couple to the environment and need to be modelled as open quantum systems. While near-optimal algorithms have been developed for simulating many-body quantum dynamics, algorithms for their open system counterparts remain less well investigated. We address the problem of simulating geometrically local many-body open quantum systems interacting with a stationary Gaussian environment. Under a smoothness assumption on the system-environment interaction, we develop near-optimal algorithms that, for a model with $N$ spins and evolution time $t$, attain a simulation error $\delta$ in the system-state with $\mathcal{O}(Nt(Nt/\delta)^{o(1)})$ gates, $\mathcal{O}(t(Nt/\delta)^{o(1)})$ parallelized circuit depth and $\tilde{\mathcal{O}}(N(Nt/\delta)^{o(1)})$ ancillas. We additionally show that, if only simulating local observables is of interest, then the circuit depth of the digital algorithm can be chosen to be independent of the system size $N$. This provides theoretical evidence for the utility of these algorithms for simulating physically relevant models, where typically local observables are of interest, on pre-fault tolerant devices. Finally, for the limiting case of Markovian dynamics with commuting jump operators, we propose two algorithms based on sampling a Wiener process and on a locally dilated Hamiltonian construction, respectively. These algorithms reduce the asymptotic gate complexity on $N$ compared to currently available algorithms in terms of the required number of geometrically local gates.

quant-ph↗

arXiv2025

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^{\alpha})$ realizing the MPU, where the constant $\alpha$ 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^{\beta} \, \mathrm{poly}\, D)$ where $\beta \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↗

arXiv2025

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↗

arXiv2025

Theory of quantum-enhanced interferometry with general Markovian light sources

Quantum optical systems comprising quantum emitters interacting with engineered optical modes generate non-classical states of light that can be used as resource states for quantum-enhanced interferometry. However, outside of well-controlled systems producing either single-mode states (e.g. Fock states or squeezed states) or highly symmetric multi-mode states (e.g. superradiant states), their potential for quantum advantage remains uncharacterized. In this work, we develop a framework to analyze quantum enhanced interferometry with general Markovian quantum light sources. First, we show how to compute the quantum Fisher Information (QFI) of the photons emitted by a source efficiently by just tracking its internal dynamics and without explicitly computing the state of the emitted photons. We then use this relationship to elucidate the connection between the level structure and spectrum of the source to a potential quantum advantage in interferometry. Finally, we analyze optimal measurement protocols that can be used to achieve this quantum advantage with experimentally available optical elements. In particular, we show that tunable optical elements with Kerr non-linearity can always be harnessed to implement the optimal measurement for any given source. Simultaneously, we also outline general conditions under which linear optics and photodetection is enough to implement the optimal measurement.

quant-ph↗

arXiv2025

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↗

arXiv2025

Cooperative Effects in Thin Dielectric Layers: Long-Range Dicke Superradiance

The realization and control of collective effects in quantum emitter ensembles have predominantly focused on small, ordered systems, leaving their extension to larger, more complex configurations as a significant challenge. Quantum photonic platforms, with their engineered Green's functions and integration of advanced solid-state quantum emitters, provide opportunities to explore new regimes of light-matter interaction beyond the scope of atomic systems. In this study, we examine the interaction of quantum emitters embedded within a thin dielectric layer. Our results reveal that the guided optical modes of the dielectric layer mediate extended-range interactions between emitters, enabling both total and directional superradiance in arrays spanning several wavelengths. Additionally, the extended interaction range facilitated by the dielectric layer supports Dicke superradiance in regimes where collective effects cannot be obtained in a homogeneous environment. This work uncovers a distinctive interplay between environmental dimensionality and collective quantum dynamics, paving the way for exploring novel many-body quantum optical phenomena in engineered photonic environments.

quant-ph↗

arXiv2024

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\"atze simpler than tensor networks in systems whose structure is invariant under permutations.

quant-ph↗

arXiv2024

A Lieb-Robinson bound for open quantum systems with memory

We consider a general class of spatially local non-Markovian open quantum lattice models, with a bosonic environment that is approximated as Gaussian. Under the assumption of a finite environment memory time, formalized as a finite total variation of the memory kernel, we show that these models satisfy a Lieb-Robinson bound. Our work generalizes Lieb Robinson bounds for open quantum systems, which have previously only been established in the Markovian limit. Using these bounds, we then show that these non-Markovian models can be well approximated by a larger Markovian model, which contains the system spins together with only a finite number of environment modes. In particular, 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↗

arXiv2024

Rigorous Bound on the Violation of Dynamic Reciprocity Induced by Four-Wave Mixing

Dynamic reciprocity imposes stringent performance constraints on nonlinear optical devices such as isolators and circulators. The seminal result by Shi et al. establishes that nonlinear optical devices relying on the intensity-dependent refractive index obey dynamic reciprocity for small signals with spectrally distinct fields. However, it has also been recognized that it is possible to violate dynamic reciprocity by exploiting frequency mixing processes. In this paper, we establish a rigorous upper bound on this violation that is independent of device geometry. We demonstrate that this bound captures the parameter scalings of realizable physical systems, and that under some conditions dynamic reciprocity violation can grow unbounded to achieve arbitrary nonlinear isolation. These results provide an analytically robust version of dynamic reciprocity, as well as theoretical guidance for the development of power efficient nonlinear optical isolators and circulators.

physics.optics↗

arXiv2024

Pauli path simulations of noisy quantum circuits beyond average case

For random quantum circuits on $n$ qubits of depth $\Theta(\log n)$ with depolarizing noise, the task of sampling from the output state can be efficiently performed classically using a Pauli path method [Aharonov et al. Proceedings of the 55th Annual ACM Symposium on Theory of Computing. 2023] . This paper aims to study the performance of this method beyond random circuits. We first consider the classical simulation of local observables in circuits composed of Clifford and T gates $\unicode{x2013}$ going beyond the average case analysis, we derive sufficient conditions for simulatability in terms of the noise rate and the fraction of gates that are T gates, and show that if noise is introduced at a faster rate than T gates, the simulation becomes classically easy. As an application of this result, we study 2D QAOA circuits that attempt to find low-energy states of classical Ising models on general graphs. There, our results shows that for hard instances of the problem, which correspond to Ising model's graph being geometrically non-local, a QAOA algorithm mapped to a geometrically local circuit architecture using SWAP gates does not have any asymptotic advantage over classical algorithms if depolarized at a constant rate. Finally, we illustrate instances where the Pauli path method fails to give the correct result, and also initiate a study of the trade-off between fragility to noise and classical complexity of simulating a given quantum circuit.

quant-ph↗