Rahul Trivedi

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, by connecting the quantum Fisher information (QFI) of the photons emitted by a source to the multi-time correlation functions and the source dynamics, we elucidate the link between the level structure and spectrum of the source to a potential quantum advantage in interferometry. Second, 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.

We develop a framework for matrix product quantum channels, 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. Then, we 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.

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.

Standard approaches to quantum error correction (QEC) require active maintenance using measurements and classical processing. The possibility of passive QEC has so far only been established in an unphysical number of spatial dimensions. In this work, we present a simple method for autonomous QEC in two spatial dimensions, formulated as a quantum cellular automaton with a fixed, local and translation-invariant update rule. The construction uses hierarchical, self-simulating control elements based on the classical schemes from the seminal results of Gács (1986, 1989) together with a measurement-free concatenated code. We analyze the system under a local noise model and prove a noise threshold below which the logical errors are suppressed arbitrarily with increasing system size and the memory lifetime diverges in the thermodynamic limit. The scheme admits a continuous-time implementation as a time-independent, translation-invariant local Lindbladian with engineered dissipative jump operators. Further, the recursive nature of our protocol allows for the fault-tolerant encoding of arbitrary quantum circuits and thus constitutes a self-correcting universal quantum computer.

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 β poly D ) where β ≤ 1 + log 2 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.

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 (MPSs) 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 MPSs, as well as further relevant examples of MPSs 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.

We characterize the dynamical state of many-body bosonic and fermionic many-body models with intersite 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 intersite 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 intersite couplings.

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.

Many-body open quantum systems, described by Lindbladian master equations, are a rich class of physical models that display complex equilibrium and out-of-equilibrium phenomena which remain to be understood. In this paper, we theoretically analyze noisy analog quantum simulation of geometrically local open quantum systems and provide evidence that this problem both is hard to simulate on classical computers and could be approximately solved on near-term quantum devices. First, given a noiseless quantum simulator, we show that the dynamics of local observables and the fixed-point expectation values of rapidly mixing local observables in geometrically local Lindbladians can be obtained to a precision of ϵ in time that is poly ( ϵ − 1 ) and uniform in system size. Furthermore, we establish that the quantum simulator would provide a superpolynomial advantage, in run-time scaling with respect to the target precision and either the evolution time (when simulating dynamics) or the Lindbladian’s decay rate (when simulating fixed points), over any classical algorithm for these problems, assuming BQP ≠ BPP . We then consider the presence of noise in the quantum simulator in the form of additional geometrically local Lindbladian terms. We show that the simulation tasks considered in this paper are stable to errors; i.e., they can be solved to a noise-limited, but system-size independent, precision. Finally, we establish that, assuming BQP ≠ BPP , there are stable geometrically local Lindbladian simulation problems such that, as the noise rate on the simulator is reduced, classical algorithms must take time superpolynomially longer in the inverse noise rate to attain the same precision as the analog quantum simulator.

Matrix-product unitaries (MPU) are 1D tensor networks describing time evolution and unitary symmetries of quantum systems, while their action on states by construction preserves the entanglement area law. MPU which are formed by a single repeated tensor are known to coincide with 1D quantum cellular automata (QCA), i.e., unitaries with an exact light cone. However, this correspondence breaks down for MPU with open boundary conditions, even if the resulting operator is translation-invariant. Such unitaries can turn short- to long-range correlations and thus alter the underlying phase of matter. Here we make the first steps towards a theory of MPU with uniform bulk but arbitrary boundary. In particular, we study the structure of a subclass with a direct-sum form which maximally violates the QCA property. We also consider the general case of MPU formed by site-dependent (nonuniform) tensors and show a correspondence between MPU and locally maximally entanglable states.