SearcharxivSearch

arXiv subjects

Kavan Modi

Publications and source records attributed to Kavan Modi.

At least 55 records · Page 3Linked to original sources

Non-Markovian Memory Strength Bounds Quantum Process Recoverability

Generic non-Markovian quantum processes have infinitely long memory, implying an exact description that grows exponentially in complexity with observation time. Here, we present a finite memory ansatz that approximates (or recovers) the true process with errors bounded by the strength of the non-Markovian memory. The introduced memory strength is an operational quantity and depends on the way the process is probed. Remarkably, the recovery error is bounded by the smallest memory strength over all possible probing methods. This allows for an unambiguous and efficient description of non-Markovian phenomena, enabling compression and recovery techniques pivotal to near-term technologies. We highlight the implications of our results by analyzing an exactly solvable model to show that memory truncation is possible even in a highly non-Markovian regime.

quant-ph

Extracting Quantum Dynamical Resources: Consumption of Non-Markovianity for Noise Reduction

Noise is possibly the most formidable challenge for quantum technologies. As such, a great deal of effort is dedicated to developing methods for noise reduction. One remarkable achievement in this direction is dynamical decoupling; it details a clear set of instructions for counteracting the effects of quantum noise. Yet, the domain of its applicability remains limited to devices where exercising fast control is possible. In practical terms, this is highly limiting and there is a growing need for better noise reduction tools. Here we take a significant step in this direction, by identifying the crucial ingredients required for noise suppression and the development of methods that far outperform traditional dynamical decoupling techniques. Using resource theoretic methods, we show that the key resource responsible for the efficacy of dynamical decoupling, and related protocols, is non-Markovianity (or temporal correlations). Using this insight, we then propose two methods to identify optimal pulse sequences for noise reduction. With an explicit example, we show that our methods enable a more optimal exploitation of temporal correlations, and extend the timescales at which noise suppression is viable by at least two orders of magnitude. Importantly, the corresponding tools are built on operational grounds and are easily implemented in the current generation of quantum devices.

quant-ph

Quantum non-Markovianity elusive to interventions

The non-Markovian nature of open quantum dynamics lies in the structure of the multitime correlations, which are accessible by means of interventions. Here, by examining multitime correlations, we show that it is possible to engineer non-Markovian systems with only long-term memory but seemingly no short-term memory, so that their non-Markovianity is completely non-detectable by any interventions up to an arbitrarily large time. Our results raise the question about the assessibility of non-Markovianity: in principle, non-Markovian effects that are perfectly elusive to interventions may emerge at much later times.

quant-ph

Memory in quantum dot blinking

The photoluminescence intermittency (blinking) of quantum dots is interesting because it is an easily-measured quantum process whose transition statistics cannot be explained by Fermi's Golden Rule. Commonly, the transition statistics are power-law distributed, implying that quantum dots possess at least trivial memories. By investigating the temporal correlations in the blinking data, we demonstrate with high statistical confidence that quantum dot blinking data has non-trivial memory, which we define to be statistical complexity greater than one. We show that this memory cannot be discovered using the transition distribution. We show by simulation that this memory does not arise from standard data manipulations. Finally, we conclude that at least three physical mechanisms can explain the measured non-trivial memory: 1) Storage of state information in the chemical structure of a quantum dot; 2) The existence of more than two intensity levels in a quantum dot; and 3) The overlap in the intensity distributions of the quantum dot states, which arises from fundamental photon statistics.

cond-mat.mes-hall

Genuine Multipartite Entanglement in Time

While spatial quantum correlations have been studied in great detail, much less is known about the genuine quantum correlations that can be exhibited by temporal processes. Employing the quantum comb formalism, processes in time can be mapped onto quantum states, with the crucial difference that temporal correlations have to satisfy causal ordering, while their spatial counterpart is not constrained in the same way. Here, we exploit this equivalence and use the tools of multipartite entanglement theory to provide a comprehensive picture of the structure of correlations that (causally ordered) temporal quantum processes can display. First, focusing on the case of a process that is probed at two points in time -- which can equivalently be described by a tripartite quantum state -- we provide necessary as well as sufficient conditions for the presence of bipartite entanglement in different splittings. Next, we connect these scenarios to the previously studied concepts of quantum memory, entanglement breaking superchannels, and quantum steering, thus providing both a physical interpretation for entanglement in temporal quantum processes, and a determination of the resources required for its creation. Additionally, we construct explicit examples of W-type and GHZ-type genuinely multipartite entangled two-time processes and prove that genuine multipartite entanglement in temporal processes can be an emergent phenomenon. Finally, we show that genuinely entangled processes across multiple times exist for any number of probing times.

quant-ph

Markovianization with approximate unitary designs

Memoryless processes are ubiquitous in nature, in contrast with the mathematics of open systems theory, which states that non-Markovian processes should be the norm. This discrepancy is usually addressed by subjectively making the environment forgetful. Here we prove that there are physical non-Markovian processes that with high probability look highly Markovian for all orders of correlations; we call this phenomenon Markovianization. Formally, we show that when a quantum process has dynamics given by an approximate unitary design, a large deviation bound on the size of non-Markovian memory is implied. We exemplify our result employing an efficient construction of an approximate unitary circuit design using two-qubit interactions only, showing how seemingly simple systems can speedily become forgetful. Conversely, since the process is closed, it should be possible to detect the underlying non-Markovian effects. However, for these processes, observing non-Markovian signatures would require highly entangling resources and hence be a difficult task.

quant-ph

Quantum chicken-egg dilemmas: Delayed-choice causal order and the reality of causal non-separability

Recent frameworks describing quantum mechanics in the absence of a global causal order admit the existence of causally indefinite processes, where it is impossible to ascribe causal order for events A and B. These frameworks even allow for processes that violate the so-called causal inequalities, which are analogous to Bell's inequalities. However, the physicality of these exotic processes is, in the general case, still under debate, bringing into question their foundational relevance. While it is known that causally indefinite processes can be probabilistically realised by means of a quantum circuit, along with an additional conditioning event C, concrete insights into the ontological meaning of such implementation schemes have heretofore been limited. Here, we show that causally indefinite processes can be realised with schemes where C serves only as a classical flag heralding which causally indefinite process was realised. We then show that there are processes where any pure conditioning measurement of C leads to a causally indefinite process for A and B, thus establishing causal indefiniteness as a basis-independent quantity. Finally, we demonstrate that quantum mechanics allows for phenomena where C can deterministically decide whether A comes before B or vice versa, without signalling to either. This is akin to Wheeler's famous delayed-choice experiment establishing definite causal order in quantum mechanics as instrument-\textit{dependent} property.

quant-ph

Quantum stochastic processes and quantum non-Markovian phenomena

The field of classical stochastic processes forms a major branch of mathematics. They are, of course, also very well studied in biology, chemistry, ecology, geology, finance, physics, and many more fields of natural and social sciences. When it comes to quantum stochastic processes, however, the topic is plagued with pathological issues that have led to fierce debates amongst researchers. Recent developments have begun to untangle these issues and paved the way for generalizing the theory of classical stochastic processes to the quantum domain without ambiguities. This tutorial details the structure of quantum stochastic processes, in terms of the modern language of quantum combs, and is aimed at students in quantum physics and quantum information theory. We begin with the basics of classical stochastic processes and generalize the same ideas to the quantum domain. Along the way, we discuss the subtle structure of quantum physics that has led to troubles in forming an overarching theory for quantum stochastic processes. We close the tutorial by laying out many exciting problems that lie ahead in this branch of science.

quant-ph

Resource theories of multi-time processes: A window into quantum non-Markovianity

We investigate the conditions under which an uncontrollable background processes may be harnessed by an agent to perform a task that would otherwise be impossible within their operational framework. This situation can be understood from the perspective of resource theory: rather than harnessing 'useful' quantum states to perform tasks, we propose a resource theory of quantum processes across multiple points in time. Uncontrollable background processes fulfil the role of resources, and a new set of objects called superprocesses, corresponding to operationally implementable control of the system undergoing the process, constitute the transformations between them. After formally introducing a framework for deriving resource theories of multi-time processes, we present a hierarchy of examples induced by restricting quantum or classical communication within the superprocess - corresponding to a client-server scenario. The resulting nine resource theories have different notions of quantum or classical memory as the determinant of their utility. Furthermore, one of these theories has a strict correspondence between non-useful processes and those that are Markovian and, therefore, could be said to be a true 'quantum resource theory of non-Markovianity'.

quant-ph

Bounding generalized relative entropies: Nonasymptotic quantum speed limits

Information theory has become an increasingly important research field to better understand quantum mechanics. Noteworthy, it covers both foundational and applied perspectives, also offering a common technical language to study a variety of research areas. Remarkably, one of the key information-theoretic quantities is given by the relative entropy, which quantifies how difficult is to tell apart two probability distributions, or even two quantum states. Such a quantity rests at the core of fields like metrology, quantum thermodynamics, quantum communication and quantum information. Given this broadness of applications, it is desirable to understand how this quantity changes under a quantum process. By considering a general unitary channel, we establish a bound on the generalized relative entropies (Rényi and Tsallis) between the output and the input of the channel. As an application of our bounds, we derive a family of quantum speed limits based on relative entropies. Possible connections between this family with thermodynamics, quantum coherence, asymmetry and single-shot information theory are briefly discussed.

quant-ph

Demonstration of non-Markovian process characterisation and control on a quantum processor

In the scale-up of quantum computers, the framework underpinning fault-tolerance generally relies on the strong assumption that environmental noise affecting qubit logic is uncorrelated (Markovian). However, as physical devices progress well into the complex multi-qubit regime, attention is turning to understanding the appearance and mitigation of correlated -- or non-Markovian -- noise, which poses a serious challenge to the progression of quantum technology. This error type has previously remained elusive to characterisation techniques. Here, we develop a framework for characterising non-Markovian dynamics in quantum systems and experimentally test it on multi-qubit superconducting quantum devices. Where noisy processes cannot be accounted for using standard Markovian techniques, our reconstruction predicts the behaviour of the devices with an infidelity of $10^{-3}$. Our results show this characterisation technique leads to superior quantum control and extension of coherence time by effective decoupling from the non-Markovian environment. This framework, validated by our results, is applicable to any controlled quantum device and offers a significant step towards optimal device operation and noise reduction.

quant-ph

Equilibration on average in quantum processes with finite temporal resolution

We characterize the conditions under which a multi-time quantum process with a finite temporal resolution can be approximately described by an equilibrium one. By providing a generalization of the notion of equilibration on average, where a system remains closed to a fixed equilibrium for most times, to one which can be operationally assessed at multiple times, we place an upper-bound on a new observable distinguishability measure comparing a multi-time process with a finite temporal resolution against a fixed equilibrium one. While the same conditions on single-time equilibration, such as a large occupation of energy levels in the initial state remain necessary, we obtain genuine multi-time contributions depending on the temporal resolution of the process and the amount of disturbance of the observer's operations on it.

quant-ph

Probabilistic and Approximate Masking of Quantum Information

The no-masking theorem states that it is impossible to encode an arbitrary quantum state into the correlations between two subsystems so that no original information about is accessible in the marginal state of either subsystem. In this paper, we generalize this theorem to allow for failure of the protocol. We then bound the performance of a masking protocol when we are allowed a (probabilistic) approximate protocol.

quant-ph

General anesthesia reduces complexity and temporal asymmetry of the informational structures derived from neural recordings in Drosophila

We apply techniques from the field of computational mechanics to evaluate the statistical complexity of neural recording data from fruit flies. First, we connect statistical complexity to the flies' level of conscious arousal, which is manipulated by general anesthesia (isoflurane). We show that the complexity of even single channel time series data decreases under anesthesia. The observed difference in complexity between the two states of conscious arousal increases as higher orders of temporal correlations are taken into account. We then go on to show that, in addition to reducing complexity, anesthesia also modulates the informational structure between the forward- and reverse-time neural signals. Specifically, using three distinct notions of temporal asymmetry we show that anesthesia reduces temporal asymmetry on information-theoretic and information-geometric grounds. In contrast to prior work, our results show that: (1) Complexity differences can emerge at very short timescales and across broad regions of the fly brain, thus heralding the macroscopic state of anesthesia in a previously unforeseen manner, and (2) that general anesthesia also modulates the temporal asymmetry of neural signals. Together, our results demonstrate that anesthetized brains become both less structured and more reversible.

q-bio.NC

Tensor network based machine learning of non-Markovian quantum processes

We show how to learn structures of generic, non-Markovian, quantum stochastic processes using a tensor network based machine learning algorithm. We do this by representing the process as a matrix product operator (MPO) and train it with a database of local input states at different times and the corresponding time-nonlocal output state. In particular, we analyze a qubit coupled to an environment and predict output state of the system at different time, as well as reconstruct the full system process. We show how the bond dimension of the MPO, a measure of non-Markovianity, depends on the properties of the system, of the environment and of their interaction. Hence, this study opens the way to a possible experimental investigation into the process tensor and its properties.

quant-ph

Kolmogorov extension theorem for (quantum) causal modelling and general probabilistic theories

In classical physics, the Kolmogorov extension theorem lays the foundation for the theory of stochastic processes. It has been known for a long time that, in its original form, this theorem does not hold in quantum mechanics. More generally, it does not hold in any theory of stochastic processes -- classical, quantum or beyond -- that does not just describe passive observations, but allows for active interventions. Such processes form the basis of the study of causal modelling across the sciences, including in the quantum domain. To date, these frameworks have lacked a conceptual underpinning similar to that provided by Kolmogorov's theorem for classical stochastic processes. We prove a generalized extension theorem that applies to all theories of stochastic processes, putting them on equally firm mathematical ground as their classical counterpart. Additionally, we show that quantum causal modelling and quantum stochastic processes are equivalent. This provides the correct framework for the description of experiments involving continuous control, which play a crucial role in the development of quantum technologies. Furthermore, we show that the original extension theorem follows from the generalized one in the correct limit, and elucidate how a comprehensive understanding of general stochastic processes allows one to unambiguously define the distinction between those that are classical and those that are quantum.

quant-ph

Resource speed limits: Maximal rate of resource variation

Recent advances in quantum resource theories have been driven by the fact that many quantum information protocols make use of different facets of the same physical features, e.g. entanglement, coherence, etc. Resource theories formalise the role of these important physical features in a given protocol. One question that remains open until now is: How quickly can a resource be generated or degraded? Using the toolkit of quantum speed limits we construct bounds on the minimum time required for a given resource to change by a fixed increment, which might be thought of as the power of said resource, i.e., rate of resource variation. We show that the derived bounds are tight by considering several examples. Finally, we discuss some applications of our results, which include bounds on thermodynamic power, generalised resource power, and estimating the coupling strength with the environment.

quant-ph

George Sudarshan and Quantum Dynamics

These are my recollections of working with George Sudarshan from 2002 to 2008 when I was a PhD student in his group. During these years I learnt a lot of physics and also witness to some remarkable occurrences.

physics.hist-ph