arXiv subjects

Mile Gu

Publications and source records attributed to Mile Gu.

At least 127 records · Page 7Linked to original sources

arXiv2015

Power of One Bit of Quantum Information in Quantum Metrology

We construct a model of quantum metrology inspired by the computational model known as deterministic quantum computation with one quantum bit (DQC1). Using only one pure qubit together with $l$ fully-mixed qubits we obtain measurement precision at the standard quantum limit, which is typically obtained using the same number of uncorrelated qubits in fully-pure states. The standard quantum limit can be exceeded using an additional qubit, which adds only a small amount of purity. We show that the discord in the final state vanishes only in the limit of attaining infinite precision for the parameter being estimated.

quant-ph↗

arXiv2014

Replicating the benefits of closed timelike curves without breaking causality

In general relativity, closed timelike curves can break causality with remarkable and unsettling consequences. At the classical level, they induce causal paradoxes disturbing enough to motivate conjectures that explicitly prevent their existence. At the quantum level, resolving such paradoxes induce radical benefits - from cloning unknown quantum states to solving problems intractable to quantum computers. Instinctively, one expects these benefits to vanish if causality is respected. Here we show that in harnessing entanglement, we can efficiently solve NP-complete problems and clone arbitrary quantum states - even when all time-travelling systems are completely isolated from the past. Thus, the many defining benefits of closed timelike curves can still be harnessed, even when causality is preserved. Our results unveil the subtle interplay between entanglement and general relativity, and significantly improve the potential of probing the radical effects that may exist at the interface between relativity and quantum theory.

quant-ph↗

arXiv2014

Local convertibility and the quantum simulation of edge states in many-body systems

In some many-body systems, certain ground state entanglement (Renyi) entropies increase even as the correlation length decreases. This entanglement non-monotonicity is a potential indicator of non-classicality. In this work we demonstrate that such a phenomenon, known as non-local convertibility, is due to the edge state (de)construction occurring in the system. To this end, we employ the example of the Ising chain, displaying an order-disorder quantum phase transitions. Employing both analytical and numerical methods, we compute entanglement entropies for various system bipartitions (A|B) and consider ground states with and without Majorana edge states. We find that the thermal ground states, enjoying the Hamiltonian symmetries, show non-local convertibility if either A or B are smaller than, or of the order of, the correlation length. In contrast, the ordered (symmetry breaking) ground state is always locally convertible. The edge states behavior explains all these results and could disclose a paradigm to understand local convertibility in other quantum phases of matter. The connection we establish between convertibility and non-local, quantum correlations provides a clear criterion of which features a universal quantum simulator should possess to outperform a classical machine.

cond-mat.stat-mech↗

arXiv2014

Towards Quantifying Complexity with Quantum Mechanics

While we have intuitive notions of structure and complexity, the formalization of this intuition is non-trivial. The statistical complexity is a popular candidate. It is based on the idea that the complexity of a process can be quantified by the complexity of its simplest mathematical model - the model that requires the least past information for optimal future prediction. Here we review how such models, known as $ε$-machines can be further simplified through quantum logic, and explore the resulting consequences for understanding complexity. In particular, we propose a new measure of complexity based on quantum $ε$-machines. We apply this to a simple system undergoing constant thermalization. The resulting quantum measure of complexity aligns more closely with our intuition of how complexity should behave.

quant-ph↗

arXiv2013

Quantum Computing with black-box Subroutines

Modern programming relies on our ability to treat preprogrammed functions as black boxes - we can invoke them as subroutines without knowing their physical implementation. Here we show it is generally impossible to execute an unknown quantum subroutine. This, as a special case, forbids applying black-box subroutines conditioned on an ancillary qubit. We explore how this limits many quantum algorithms - forcing their circuit implementation to be individually tailored to specific inputs and inducing failure if these inputs are not known in advance. We present a method to avoid this situation for certain computational problems. We apply this method to enhance existing quantum factoring algorithms; reducing their complexity, and the extent to which they need to be tailored to factor specific numbers. Thus, we highlight a natural property of classical information that fails in the advent of quantum logic; and simultaneously demonstrate how to mitigate its effects in practical situations.

quant-ph↗

arXiv2013

Entanglement-free certification of entangling gates

Not all quantum protocols require entanglement to outperform their classical alternatives. The nonclassical correlations that lead to this quantum advantage are conjectured to be captured by quantum discord. Here we demonstrate that discord can be explicitly used as a resource: certifying untrusted entangling gates without generating entanglement at any stage. We implement our protocol in the single-photon regime, and show its success in the presence of high levels of noise and imperfect gate operations. Our technique offers a practical method for benchmarking entangling gates in physical architectures in which only highly-mixed states are available.

quant-ph↗

arXiv2013

Particle exchange in post-quantum theories

In quantum theory, particles in three spatial dimensions come in two different types: bosons or fermions, which exhibit sharply contrasting behaviours due to their different exchange statistics. Could more general forms of probabilistic theories admit more exotic types of particles? Here, we propose a thought experiment to identify more exotic particles in general post-quantum theories. We consider how in quantum theory the phase introduced by swapping indistinguishable particles can be measured. We generalise this to post-quantum scenarios whilst imposing indistinguishability and locality principles. We show that our ability to witness exotic particle exchange statistics depends on which symmetries are admitted within a theory. These exotic particles can manifest unusual behaviour, such as non-abelianicity even in topologically simple three-dimensional space.

quant-ph↗

arXiv2013

Local characterization of 1d topologically ordered states

We consider 1d Hamiltonian systems whose ground states display symmetry protected topological order. We show that ground states within the topological phase cannot be connected with each other through LOCC between a bipartition of the system. Our claim is demonstrated by analyzing the entanglement spectrum and Renyi entropies of different physical systems providing examples for symmetry protected topological phases. Specifically, we consider spin-1/2 Cluster-Ising model and a class of spin-1 models undergoing quantum phase transitions to the Haldane phase. Our results provide a probe for simmetry-protected topological order, that holds true even at the system's local scale. Therefore our analysis can serve as as local experimental test for topological order.

quant-ph↗

arXiv2013

Experimental Quantum Computing to Solve Systems of Linear Equations

Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time proportional to the number of variables N. A recently proposed quantum algorithm shows that quantum computers could solve linear systems in a time scale of order log(N), giving an exponential speedup over classical computers. Here we realize the simplest instance of this algorithm, solving 2*2 linear equations for various input vectors on a quantum computer. We use four quantum bits and four controlled logic gates to implement every subroutine required, demonstrating the working principle of this algorithm.

quant-ph↗

arXiv2012

Coherent and incoherent contents of correlations

We examine bipartite and multipartite correlations within the construct of unitary orbits. We show that the set of product states is a very small subset of set of all possible states, while all unitary orbits contain classically correlated states. Using this we give meaning to degeneration of quantum correlations due to a unitary interactions, which we call coherent correlations. The remaining classical correlations are called incoherent correlations and quantified in terms of the distance of the joint probability distributions to its marginals. Finally, we look at how entanglement looks in this picture for the two-qubit case.

quant-ph↗

arXiv2012

Operational Significance of Discord Consumption: Theory and Experiment

Coherent interactions that generate negligible entanglement can still exhibit unique quantum behaviour. This observation has motivated a search beyond entanglement for a complete description of all quantum correlations. Quantum discord is a promising candidate. Here, we demonstrate that under certain measurement constraints, discord between bipartite systems can be consumed to encode information that can only be accessed by coherent quantum interactions. The inability to access this information by any other means allows us to use discord to directly quantify this `quantum advantage'. We experimentally encode information within the discordant correlations of two separable Gaussian states. The amount of extra information recovered by coherent interaction is quantified and directly linked with the discord consumed during encoding. No entanglement exists at any point of this experiment. Thus we introduce and demonstrate an operational method to use discord as a physical resource.

quant-ph↗

arXiv2012

Encoding Universal Computation in the Ground States of Ising Lattices

We characterize the set of ground states that can be synthesized by classical 2-body Ising Hamiltonians. We then construct simple Ising planar blocks that simulates efficiently a universal set of logic gates and connections, and hence any boolean function. We therefore provide a new method of encoding universal computation in the ground states of Ising lattices, and a simpler alternative demonstration of the known fact that finding the ground state of a finite Ising spin glass model is NP complete. We relate this with our previous result about emergence properties in infinite lattices.

cond-mat.stat-mech↗

arXiv2012

Quantum phases with differing computational power

The observation that concepts from quantum information has generated many alternative indicators of quantum phase transitions hints that quantum phase transitions possess operational significance with respect to the processing of quantum information. Yet, studies on whether such transitions lead to quantum phases that differ in their capacity to process information remain limited. Here We show that there exist quantum phase transitions that cause a distinct qualitative change in our ability to simulate certain quantum systems under perturbation of an external field by local operations and classical communication. In particular, we show that in certain quantum phases of the XY model, adiabatic perturbations of the external magnetic field can be simulated by local spin operations, whereas the resulting effect within other phases results in coherent non-local interactions. We discuss the potential implications to adiabatic quantum computation, where a computational advantage exists only when adiabatic perturbation results in coherent multi-body interactions.

quant-ph↗

arXiv2012

Occam's Quantum Razor: How Quantum Mechanics can reduce the complexity of classical models

Mathematical models are an essential component of quantitative science. They generate predictions about the future, based on information available in the present. In the spirit of Occam's razor, simpler is better; should two models make identical predictions, the one that requires less input is preferred. Yet, for almost all stochastic processes, even the provably optimal classical models waste information. The amount of input information they demand exceeds the amount of predictive information they output. We systematically construct quantum models that break this classical bound, and show that the system of minimal entropy that simulates such processes must necessarily feature quantum dynamics. This indicates that many observed phenomena could be significantly simpler than classically possible should quantum effects be involved.

quant-ph↗

arXiv2012

Quantum Passwords

A quantum password is a quantum mechanical analogue of the classical password. Our proposal is completely quantum mechanical in nature, i.e. at no point is information stored and manipulated classically. We show that, in contrast to quantum protocols that encode classical information, we are able to prevent the distribution of reusable passwords even when Alice actively cooperates with Eve. This allows us to confront and address security issues that are unavoidable in classical protocols.

quant-ph↗

arXiv2011

Information erasure lurking behind measures of complexity

Complex systems are found in most branches of science. It is still argued how to best quantify their complexity and to what end. One prominent measure of complexity (the statistical complexity) has an operational meaning in terms of the amount of resources needed to forecasting a system's behaviour. Another one (the effective measure complexity, aka excess entropy) is a measure of mutual information stored in the system proper. We show that for any given system the two measures differ by the amount of information erased during forecasting. We interpret the difference as inefficiency of a given model. We find a bound to the ratio of the two measures defined as information-processing efficiency, in analogy to the second law of thermodynamics. This new link between two prominent measures of complexity provides a quantitative criterion for good models of complex systems, namely those with little information erasure.

physics.data-an↗

arXiv2011

Information-theoretic bound on the energy cost of stochastic simulation

Physical systems are often simulated using a stochastic computation where different final states result from identical initial states. Here, we derive the minimum energy cost of simulating a complex data set of a general physical system with a stochastic computation. We show that the cost is proportional to the difference between two information-theoretic measures of complexity of the data - the statistical complexity and the predictive information. We derive the difference as the amount of information erased during the computation. Finally, we illustrate the physics of information by implementing the stochastic computation as a Gedankenexperiment of a Szilard-type engine. The results create a new link between thermodynamics, information theory, and complexity.

physics.data-an↗

arXiv2010

A reduced complexity numerical method for optimal gate synthesis

Although quantum computers have the potential to efficiently solve certain problems considered difficult by known classical approaches, the design of a quantum circuit remains computationally difficult. It is known that the optimal gate design problem is equivalent to the solution of an associated optimal control problem, the solution to which is also computationally intensive. Hence, in this article, we introduce the application of a class of numerical methods (termed the max-plus curse of dimensionality free techniques) that determine the optimal control thereby synthesizing the desired unitary gate. The application of this technique to quantum systems has a growth in complexity that depends on the cardinality of the control set approximation rather than the much larger growth with respect to spatial dimensions in approaches based on gridding of the space, used in previous literature. This technique is demonstrated by obtaining an approximate solution for the gate synthesis on $SU(4)$- a problem that is computationally intractable by grid based approaches.

math.OC↗