arXiv subjects

Rahul Trivedi

Publications and source records attributed to Rahul Trivedi.

At least 37 records · Page 2Linked to original sources

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

Pauli path simulations of noisy quantum circuits beyond average case

For random quantum circuits on $n$ qubits of depth $Θ(\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↗

arXiv2025

Computational complexity of isometric tensor network states

We determine the computational power of isometric tensor network states (isoTNS), a variational ansatz originally developed to numerically find and compute properties of gapped ground states and topological states in two dimensions. By mapping 2D isoTNS to 1+1D unitary quantum circuits, we find that computing local expectation values in isoTNS is $\textsf{BQP}$-complete. We then introduce injective isoTNS, which are those isoTNS that are the unique ground states of frustration-free Hamiltonians, and which are characterized by an injectivity parameter $δ\in(0,1/D]$, where $D$ is the bond dimension of the isoTNS. We show that injectivity necessarily adds depolarizing noise to the circuit at a rate $η=δ^2D^2$. We show that weakly injective isoTNS (small $δ$) are still $\textsf{BQP}$-complete, but that there exists an efficient classical algorithm to compute local expectation values in strongly injective isoTNS ($η\geq0.41$). Sampling from isoTNS corresponds to monitored quantum dynamics and we exhibit a family of isoTNS that undergo a phase transition from a hard regime to an easy phase where the monitored circuit can be sampled efficiently. Our results can be used to design provable algorithms to contract isoTNS. Our mapping between ground states of certain frustration-free Hamiltonians to open circuit dynamics in one dimension fewer may be of independent interest.

quant-ph↗

arXiv2025

Matrix-product unitaries: Beyond quantum cellular automata

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.

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

Accuracy guarantees and quantum advantage in analogue open quantum simulation with and without noise

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 analogue quantum simulation of geometrically local open quantum systems and provide evidence that this problem is both 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 $\varepsilon$ in time that is $\text{poly}(\varepsilon^{-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 $\neq$ BPP. We then consider the presence of noise in the quantum simulator in the form of additional geometrically-local Linbdladian 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 $\neq$ 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.

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

The quantum adiabatic algorithm suppresses the proliferation of errors

The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the proliferation of a single error event in the adiabatic algorithm. We give numerical evidence using tensor network methods that the intrinsic properties of adiabatic processes effectively constrain the amplification of errors during the evolution for geometrically local Hamiltonians. Our findings indicate that low energy states could remain attainable even in the presence of a single error event, which contrasts with results for error propagation in typical quantum circuits.

quant-ph↗

arXiv2024

Probing Off-diagonal Eigenstate Thermalization with Tensor Networks

Energy filter methods in combination with quantum simulation can efficiently access the properties of quantum many-body systems at finite energy densities [Lu et al. PRX Quantum 2, 020321 (2021)]. Classically simulating this algorithm with tensor networks can be used to investigate the microcanonical properties of large spin chains, as recently shown in [Yang et al. Phys. Rev. B 106, 024307 (2022)]. Here we extend this strategy to explore the properties of off-diagonal matrix elements of observables in the energy eigenbasis, fundamentally connected to the thermalization behavior and the eigenstate thermalization hypothesis. We test the method on integrable and non-integrable spin chains of up to 60 sites, much larger than accessible with exact diagonalization. Our results allow us to explore the scaling of the off-diagonal functions with the size and energy difference, and to establish quantitative differences between integrable and non-integrable cases.

quant-ph↗

arXiv2024

Classically computing performance bounds on depolarized quantum circuits

Quantum computers and simulators can potentially outperform classical computers in finding ground states of classical and quantum Hamiltonians. However, if this advantage can persist in the presence of noise without error correction remains unclear. In this paper, by exploiting the principle of Lagrangian duality, we develop a numerical method to classically compute a certifiable lower bound on the minimum energy attainable by the output state of a quantum circuit in the presence of depolarizing noise. We provide theoretical and numerical evidence that this approach can provide circuit-architecture dependent bounds on the performance of noisy quantum circuits.

quant-ph↗

arXiv2023

Quantum advantage and stability to errors in analogue quantum simulators

Several quantum hardware platforms, while being unable to perform fully fault-tolerant quantum computation, can still be operated as analogue quantum simulators for addressing many-body problems. However, due to the presence of errors, it is not clear to what extent those devices can provide us with an advantage with respect to classical computers. In this work we consider the use of noisy analogue quantum simulators for computing physically relevant properties of many-body systems both in equilibrium and undergoing dynamics. We first formulate a system-size independent notion of stability against extensive errors, which we prove for Gaussian fermion models, as well as for a restricted class of spin systems. Remarkably, for the Gaussian fermion models, our analysis shows the stability of critical models which have long-range correlations. Furthermore, we analyze how this stability may lead to a quantum advantage, for the problem of computing the thermodynamic limit of many-body models, in the presence of a constant error rate and without any explicit error correction.

quant-ph↗

arXiv2023

Boundary scattering tomography of the Bose Hubbard model on general graphs

Correlated quantum many-body phenomena in lattice models have been identified as a set of physically interesting problems that cannot be solved classically. Analog quantum simulators, in photonics and microwave superconducting circuits, have emerged as near-term platforms to address these problems. An important ingredient in practical quantum simulation experiments is the tomography of the implemented Hamiltonians -- while this can easily be performed if we have individual measurement access to each qubit in the simulator, this could be challenging to implement in many hardware platforms. In this paper, we present a scheme for tomography of quantum simulators which can be described by a Bose-Hubbard Hamiltonian while having measurement access to only some sites on the boundary of the lattice. We present an algorithm that uses the experimentally routine transmission and two-photon correlation functions, measured at the boundary, to extract the Hamiltonian parameters at the standard quantum limit. Furthermore, by building on quantum enhanced spectroscopy protocols that, we show that with the additional ability to switch on and off the on-site repulsion in the simulator, we can sense the Hamiltonian parameters beyond the standard quantum limit.

quant-ph↗

arXiv2023

Three-photon excitation of quantum two-level systems

We demonstrate that semiconductor quantum dots can be excited efficiently in a resonant three-photon process, whilst resonant two-photon excitation is highly suppressed. Time-dependent Floquet theory is used to quantify the strength of the multi-photon processes and model the experimental results. The efficiency of these transitions can be drawn directly from parity considerations in the electron and hole wavefunctions in semiconductor quantum dots. Finally, we exploit this technique to probe intrinsic properties of InGaN quantum dots. In contrast to non-resonant excitation, slow relaxation of charge carriers is avoided which allows us to measure directly the radiative lifetime of the lowest energy exciton states. Since the emission energy is detuned far from the resonant driving laser field, polarization filtering is not required and emission with a greater degree of linear polarization is observed compared to non-resonant excitation.

quant-ph↗

arXiv2022

Simulability transitions in continuous-time dynamics of local open quantum systems

We analyze the complexity of classically simulating continuous-time dynamics of locally interacting quantum spin systems with a constant rate of entanglement breaking noise. We prove that a polynomial time classical algorithm can be used to sample from the state of the spins when the rate of noise is higher than a threshold determined by the strength of the local interactions. Furthermore, by encoding a 1D fault tolerant quantum computation into the dynamics of spin systems arranged on two or higher dimensional grids, we show that for several noise channels, the problem of weakly simulating the output state of both purely Hamiltonian and purely dissipative dynamics is expected to be hard in the low-noise regime.

quant-ph↗

arXiv2022

Description and complexity of Non-markovian open quantum dynamics

Understanding and simulating non-Markovian quantum dynamics remains an important challenge in open quantum system theory. A key advance in this endeavour would be to develop a unified mathematical description of non-Markovian dynamics, and classify its complexity in the many-body setting. In this paper, we identify a general class of non-Markovian memory kernels, described by complex-valued radon measures, and define their dynamics through a regularization procedure constructing the corresponding system-environment unitary groups. Building on this definition, we then consider $k-$local many-body non-Markovian systems with physically motivated assumptions on the total variation and smoothness of the memory kernels. We establish that their dynamics can be efficiently approximated on quantum computers, thus providing a rigorous verification of the Extended Church-Turing thesis for this general class of non-Markovian open quantum systems.

quant-ph↗

arXiv2022

Realizing tight-binding Hamiltonians using site-controlled coupled cavity arrays

Analog quantum simulators rely on programmable quantum devices to emulate Hamiltonians describing various physical phenomenon. Photonic coupled cavity arrays are a promising platform for realizing such devices. Using a silicon photonic coupled cavity array made up of 8 high quality-factor resonators and equipped with specially designed thermo-optic island heaters for independent control of cavities, we demonstrate a programmable device implementing tight-binding Hamiltonians with access to the full eigen-energy spectrum. We report a ~50% reduction in the thermal crosstalk between neighboring sites of the cavity array compared to traditional heaters, and then present a control scheme to program the cavity array to a given tight-binding Hamiltonian.

quant-ph↗

arXiv2022

Error propagation in NISQ devices for solving classical optimization problems

We propose a random circuit model to analyze the impact of noise on the performance of variational quantum circuits for classical optimization problems. Our model accounts for the propagation of arbitrary single qubit errors through the circuit. We find that even with a small noise rate, the quality of the obtained classical optima is low on average and a single-qubit error rate of $1 / nD$, where $n$ is the number of qubits and $D$ is the circuit depth, is needed for the possibility of a quantum advantage. We estimate that this translates to an error rate lower than $10^{-6}$ using QAOA for classical optimization problems with 2D circuits.

quant-ph↗

arXiv2022

Large-N limit of spontaneous superradiance

We investigate the thermodynamic limit of Dicke superradiance. We find an expression for the system's density matrix that we can prove is exact in the limit of large atom numbers N. This is in contrast to previously known solutions whose accuracy has only been established numerically and that are valid only for a range of times. We also introduce an asymptotically exact solution when the system is subject to additional incoherent decay of excitations as this is a common occurrence in experiment.

quant-ph↗