arXiv subjects

Mile Gu

Publications and source records attributed to Mile Gu.

At least 109 records · Page 6Linked to original sources

arXiv2017

Operational effects of the UNOT gate on classical and quantum correlations

The NOT gate that flips a classical bit is ubiquitous in classical information processing. However its quantum analogue, the universal NOT (UNOT) gate that flips a quantum spin in any alignment into its antipodal counterpart is strictly forbidden. Here we explore the connection between this discrepancy and how UNOT gates affect classical and quantum correlations. We show that while a UNOT gate always preserves classical correlations between two spins, it can non-locally increase or decrease their shared discord in ways that allow violation of the data processing inequality. We experimentally illustrate this using a multi-level trapped \Yb ion that allows simulation of anti-unitary operations.

quant-ph↗

arXiv2017

Unbounded memory advantage in stochastic simulation using quantum mechanics

Simulating the stochastic evolution of real quantities on a digital computer requires a trade-off between the precision to which these quantities are approximated, and the memory required to store them. The statistical accuracy of the simulation is thus generally limited by the internal memory available to the simulator. Here, using tools from computational mechanics, we show that quantum processors with a fixed finite memory can simulate stochastic processes of real variables to arbitrarily high precision. This demonstrates a provable, unbounded memory advantage that a quantum simulator can exhibit over its best possible classical counterpart.

quant-ph↗

arXiv2017

Experimental cyclic inter-conversion between Coherence and Quantum Correlations

Quantum resource theories seek to quantify sources of non-classicality that bestow quantum technologies their operational advantage. Chief among these are studies of quantum correlations and quantum coherence. The former to isolate non-classicality in the correlations between systems, the latter to capture non-classicality of quantum superpositions within a single physical system. Here we present a scheme that cyclically inter-converts between these resources without loss. The first stage converts coherence present in an input system into correlations with an ancilla. The second stage harnesses these correlations to restore coherence on the input system by measurement of the ancilla. We experimentally demonstrate this inter-conversion process using linear optics. Our experiment highlights the connection between non-classicality of correlations and non-classicality within local quantum systems, and provides potential flexibilities in exploiting one resource to perform tasks normally associated with the other.

quant-ph↗

arXiv2017

The classical-quantum divergence of complexity in modelling spin chains

The minimal memory required to model a given stochastic process - known as the statistical complexity - is a widely adopted quantifier of structure in complexity science. Here, we ask if quantum mechanics can fundamentally change the qualitative behaviour of this measure. We study this question in the context of the classical Ising spin chain. In this system, the statistical complexity is known to grow monotonically with temperature. We evaluate the spin chain's quantum mechanical statistical complexity by explicitly constructing its provably simplest quantum model, and demonstrate that this measure exhibits drastically different behaviour: it rises to a maximum at some finite temperature then tends back towards zero for higher temperatures. This demonstrates how complexity, as captured by the amount of memory required to model a process, can exhibit radically different behaviour when quantum processing is allowed.

quant-ph↗

arXiv2017

Discord, quantum knowledge and private communications

In this brief review, we discuss the role that quantum correlations, as quantified by quantum discord, play in two interesting settings. The first one is discerning which unitaries have been applied on a quantum system, by taking advantage of knowledge regarding its initial configuration. Here discord captures the "quantum" component of this knowledge, useful only when we have access to a quantum memory. In particular, discord can be used to detect whether an untrusted party has certain quantum capabilities. The second setting is quantum cryptography. Here discord represents an important resource for trusted-noise quantum key distribution and also provides a general upper bound for the optimal secret key rates that are achievable by ideal protocols. In particular, the (two-way assisted) secret key capacity of a lossy bosonic channel exactly coincides with the maximum discord that can be distributed between the remote parties at the two ends of the channel.

quant-ph↗

arXiv2017

Unified framework for quantumness -- coherence, discord, and entanglement

From an operational perspective, quantumness characterizes the exotic behavior in a physical process which cannot be explained with Newtonian physics. There are several widely used measures of quantumness, including coherence, discord, and entanglement, each proven to be essential resources in particular situations. There exists evidence of fundamental connections amongst the three measures. However, those quantumnesses are still regarded differently and such connections are yet to be elucidated. Here, we introduce a general framework of defining a unified quantumness with an operational motivation founded on the capability of interferometry. The quantumness appears differently as coherence, discord, and entanglement in different scenarios with local measurement, weak reference frame free measurement, and strong reference frame free measurement, respectively. Our results also elaborate how these three measures are related and how they can be transformed from each other. This framework can be further extended to other scenarios and serves as a universal quantumness measure.

quant-ph↗

arXiv2017

Thermodynamics of complexity and pattern manipulation

Many organisms capitalize on their ability to predict the environment to maximize available free energy, and reinvest this energy to create new complex structures. This functionality relies on the manipulation of patterns - temporally ordered sequences of data. Here, we propose a framework to describe pattern manipulators -- devices that convert thermodynamic work to patterns or vice versa - and use them to build a 'pattern engine' that facilitates a thermodynamic cycle of pattern creation and consumption. We show that the least heat dissipation is achieved by the provably simplest devices; the ones that exhibit desired operational behaviour while maintaining the least internal memory. We derive the ultimate limits of this heat dissipation, and show that it is generally non-zero and connected with the pattern's intrinsic crypticity - a complexity theoretic quantity that captures the puzzling difference between the amount of information the pattern's past behaviour reveals about its future, and the amount one needs to communicate about this past to optimally predict the future.

quant-ph↗

arXiv2017

Overarching framework between Gaussian quantum discord and Gaussian quantum illumination

We cast the problem of illuminating an object in a noisy environment into a communication protocol. A probe is sent into the environment, and the presence or absence of the object constitutes a signal encoded on the probe. The probe is then measured to decode the signal. We calculate the Holevo information and bounds to the accessible information between the encoded and received signal with two different Gaussian probes---an Einstein-Podolsky-Rosen (EPR) state and a coherent state. We also evaluate the Gaussian discord consumed during the encoding process with the EPR probe. We find that the Holevo quantum advantage, defined as the difference between the Holevo information obtained from the EPR and coherent state probes, is approximately equal to the discord consumed. These quantities become exact in the typical illumination regime of low object reflectivity and low probe energy. Hence we show that discord is the resource responsible for the quantum advantage in Gaussian quantum illumination.

quant-ph↗

arXiv2017

Using quantum theory to reduce the complexity of input-output processes

All natural things process and transform information. They receive environmental information as input, and transform it into appropriate output responses. Much of science is dedicated to building models of such systems -- algorithmic abstractions of their input-output behavior that allow us to simulate how such systems can behave in the future, conditioned on what has transpired in the past. Here, we show that classical models cannot avoid inefficiency -- storing past information that is unnecessary for correct future simulation. We construct quantum models that mitigate this waste, whenever it is physically possible to do so. This suggests that the complexity of general input-output processes depends fundamentally on what sort of information theory we use to describe them.

quant-ph↗

arXiv2016

Thermodynamical cost of some interpretations of quantum theory

The interpretation of quantum theory is one of the longest-standing debates in physics. Type I interpretations see quantum probabilities as determined by intrinsic properties of the observed system. Type II see them as relational experiences between an observer and the system. It is usually believed that a decision between these two options cannot be made simply on purely physical grounds but requires an act of metaphysical judgment. Here we show that, under some assumptions, the problem is decidable using thermodynamics. We prove that type I interpretations are incompatible with the following assumptions: (i) The choice of which measurement is performed can be made randomly and independently of the system under observation, (ii) the system has limited memory, and (iii) Landauer's erasure principle holds.

quant-ph↗

arXiv2016

Quantum processes which do not use coherence

A major signature of quantum mechanics beyond classical physics is coherence, the existence of superposition states. The recently developed resource theory of quantum coherence allows the formalisation of incoherent operations -- those operations which cannot create coherence. We identify the set of operations which additionally do not use coherence. These are such that coherence cannot be exploited by a classical observer, who measures incoherent properties of the system, to go beyond classical dynamics. We give a physical interpretation in terms of interferometry and prove a dilation theorem, showing how these operations can always be constructed by interacting the system in an incoherent way with an ancilla. Such a physical justification is not known for the incoherent operations, thus our results lead to a physically well-motivated resource theory of coherence. Next, we investigate the implications for coherence in multipartite systems. We show that quantum correlations can be defined naturally with respect to a fixed basis, providing a link between coherence and quantum discord. We demonstrate the interplay between these two quantities under our studied operations, and suggest implications for the theory of quantum discord by relating the studied operations to those which cannot create discord.

quant-ph↗

arXiv2016

Fragile states are better for quantum metrology

In quantum metrology, quantum probe states are capable of estimating unknown physical parameters to precisions beyond classical limits. What qualities do such states possess? Here we relate the performance of a probe state at estimating a parameter $ϕ$ -- as quantified by the quantum Fisher information -- to the amount of purity it loses when $ϕ$ undergoes statistical fluctuation. This indicates that the better a state is for estimating $ϕ$, the more it decoheres when $ϕ$ is subject to noise.

quant-ph↗

arXiv2016

The power of one qumode for quantum computation

Although quantum computers are capable of solving problems like factoring exponentially faster than the best-known classical algorithms, determining the resources responsible for their computational power remains unclear. An important class of problems where quantum computers possess an advantage is phase estimation, which includes applications like factoring. We introduce a new computational model based on a single squeezed state resource that can perform phase estimation, which we call the power of one qumode. This model is inspired by an interesting computational model known as deterministic quantum computing with one quantum bit (DQC1). Using the power of one qumode, we identify that the amount of squeezing is sufficient to quantify the resource requirements of different computational problems based on phase estimation. In particular, it establishes a quantitative relationship between the resources required for factoring and DQC1. For example, we find the squeezing required to factor has an exponential scaling whereas no squeezing (i.e., a coherent state) is already sufficient to solve the hardest problem in DQC1.

quant-ph↗

arXiv2016

Converting Coherence to Quantum Correlations

Recent results in quantum information theory characterize quantum coherence in the context of resource theories. Here we study the relation between quantum coherence and quantum discord, a kind of quantum correlation which appears even in non-entangled states. We prove that the creation of quantum discord with multipartite incoherent operations is bounded by the amount of quantum coherence consumed in its subsystems during the process. We show how the interplay between quantum coherence consumption and creation of quantum discord works in the preparation of multipartite quantum correlated states and in the model of deterministic quantum computation with one qubit.

quant-ph↗

arXiv2016

How Discord underlies the Noise Resilience of Quantum Illumination

The benefits of entanglement can outlast entanglement itself. In quantum illumination, entanglement is employed to better detect reflecting objects in environments so noisy that all entanglement is destroyed. Here, we show that quantum discord - a more resilient form of quantum correlations - explains the resilience of quantum illumination. We introduce a quantitative relation between the performance gain in quantum illumination and the amount of discord used to encode information about the presence or absence of a reflecting object. This highlights discord's role preserving the benefits of entanglement in entanglement breaking noise.

quant-ph↗

arXiv2016

Experimental quantum processing enhancement in modelling stochastic processes

Computer simulation of observable phenomena is an indispensable tool for engineering new technology, understanding the natural world, and studying human society. Yet the most interesting systems are often complex, such that simulating their future behaviour demands storing immense amounts of information regarding how they have behaved in the past. For increasingly complex systems, simulation becomes increasingly difficult and is ultimately constrained by resources such as computer memory. Recent theoretical work shows quantum theory can reduce this memory requirement beyond ultimate classical limits (as measured by a process' statistical complexity, C). Here we experimentally demonstrate this quantum advantage in simulating stochastic processes. Our quantum implementation observes a memory requirement of C_q = 0.05 $\pm$ 0.01, far below the ultimate classical limit of C = 1. Scaling up this technique would substantially reduce the memory required in simulation of more complex systems.

quant-ph↗

arXiv2016

Beating the Clauser-Horne-Shimony-Holt and the Svetlichny games with Optimal States

We study the relation between the maximal violation of Svetlichny's inequality and the mixedness of quantum states and obtain the optimal state (i.e., maximally nonlocal mixed states, or MNMS, for each value of linear entropy) to beat the Clauser-Horne-Shimony-Holt and the Svetlichny games. For the two-qubit and three-qubit MNMS, we showed that these states are also the most tolerant state against white noise, and thus serve as valuable quantum resources for such games. In particular, the quantum prediction of the MNMS decreases as the linear entropy increases, and then ceases to be nonlocal when the linear entropy reaches the critical points ${2}/{3}$ and ${9}/{14}$ for the two- and three-qubit cases, respectively. The MNMS are related to classical errors in experimental preparation of maximally entangled states.

quant-ph↗

arXiv2015

Delayed Choice Contextuality: A way to rule out Contextual Hidden Variables

A PhD student is locked inside a box, imitating a quantum system by mimicking the measurement statistics of any viable observable nominated by external observers. Inside a second box lies a genuine quantum system. Either box can be used to pass a test for contextuality - and from the perspective of an external observer, be operationally indistinguishable. There is no way to discriminate between the two boxes based on the output statistics of any contextuality test. This poses a serious problem for contextuality tests to be used as viable tests for device independent quantumness, and severely limits realistic use of contextuality as an operational resource. Here we rectify this problem by building experimental techniques for distinguishing a contextual system that is genuinely quantum, and one that mimics it through clever use of hidden variables.

quant-ph↗