Richard Jozsa
We argue that entanglement is the essential non-classical ingredient which provides the computational speed-up in quantum algorithms as compared to algorithms based on the processes of classical physics.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
This paper discusses relationships between topological entanglement and quantum entanglement. Specifically, we propose that for this comparison it is fundamental to view topological entanglements such as braids as "entanglement operators" and to associate to them unitary operators that are capable of creating quantum entanglement.
It was shown in [T. Morimae, Phys. Rev. A {\bf81}, 060307(R) (2010)] that the gate fidelity of an inaccurate one-way quantum computation is upper bounded by a decreasing function of the amount of entanglement in the register. This means that a strong entanglement causes the low gate fidelity in the one-way quantum computation with inaccurate measurements. In this paper, we derive similar entanglement-fidelity relations for the inaccurate ancilla-driven quantum computation. These relations again imply that a strong entanglement in the register causes the low gate fidelity in the ancilla-driven …
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a resource is discussed.
It is shown that Smolin four-qubit bound entangled states [Phys. Rev. A, 63 032306 (2001)] can maximally violate two-setting Bell inequality similar to standard CHSH inequality. Surprisingly this entanglement does not allow for secure key distillation, so neither entanglement nor violation of Bell inequalities implies quantum security. It is also pointed out how that kind of bound entanglement can be useful in reducing communication complexity.
We show that universal quantum computation can be achieved in the standard pure-state circuit model while, at any time, the entanglement entropy of all bipartitions is small---even tending to zero with growing system size. The result is obtained by showing that a quantum computer operating within a small region around the set of unentangled states still has universal computational power, and by using continuity of entanglement entropy. In fact an analogous conclusion applies to every entanglement measure which is continuous in a certain natural sense, which amounts to a large class. Other exam…
Using entanglement of assistance, we establish a general polygamy inequality of multi-party entanglement in arbitrary dimensional quantum systems. For multi-party closed quantum systems, we relate our result with the monogamy of entanglement to show that the entropy of entanglement is an universal entanglement measure that bounds both monogamy and polygamy of multi-party quantum entanglement.
PhD thesis dealing with various aspects of multipartite entanglement, such as entanglement measures, absolutely maximally entangled states, bell inequalities, entanglement spectrum and quantum frustration. Also some quantum algorithms run with the IBM quantum computer are covered, together with others applied to adiabatic quantum computation and quantum thermodynamics.
The degree of entanglement in an open quantum system varies according to how information in the environment is read. A measure of this contextual entanglement is introduced based on quantum trajectory unravelings of the open system dynamics. It is used to characterize the entanglement in a driven quantum system of dimension $2\times\infty$ where the entanglement is induced by the environmental interaction. A detailed mechanism for the environment-induced entanglement is given.
It is known that if the quantum gates in a proposed quantum computer are so noisy that they are incapable of generating entanglement, then the device can be efficiently simulated classically. If the measurements and single particle operations are restricted, then the same statement can be true for generalised non-quantum notions of entanglement. Here we show that this can improve the applicability of limited-entanglement simulation algorithms. In particular, we show that by using a non-quantum notion of separability a classical simulation algorithm of Harrow & Nielsen can efficiently simulate …
Computational Entanglement Theory
本文建立计算纠缠理论，定义计算一次性纠缠成本与可提取纠缠，证明其与信息论度量的差距，并基于后量子假设构造伪纠缠态。
Entanglement is a key issue in the quantum physics which gives rise to resources for achieving tasks that are not possible within the realm of classical physics. Quantum entanglement varies with the evolution of the quantum systems. It is of significance to investigate the entanglement dynamics in terms of quantum channels. We study the entanglement-breaking channels and present the necessary and sufficient conditions for a quantum channel to an entanglement-breaking one for qubit systems. Furthermore, a concept of strong entanglement-breaking channel is introduced. The amendment of entangleme…
Recovering quantum entanglement after its certification
针对量子纠缠认证会破坏纠缠资源的问题，提出一种可概率恢复原始纠缠的认证协议，在光子系统实验验证其筛选高质量纠缠的实用性，揭示相关物理量的权衡关系，实现认证与后续应用兼容。
Role of qubits in quantum entanglement and quantum teleportation
本文探讨了量子比特在量子纠缠和量子 teleportation 中的关键作用与重要性。
We relate the problem of irreversibility of entanglement with the recently defined measures of quantum correlation - quantum discord and one-way quantum deficit. We show that the entanglement of formation is always strictly larger than the coherent information and the entanglement cost is also larger in most cases. We prove irreversibility of entanglement under LOCC for a family of entangled states. This family is a generalization of the maximally correlated states for which we also give an analytic expression for the distillable entanglement, the relative entropy of entanglement, the distilla…
For any quantum algorithm operating on pure states we prove that the presence of multi-partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an exponential speed-up over classical computation. Furthermore we prove that the algorithm can be classically efficiently simulated to within a prescribed tolerance ηeven if a suitably small amount of global entanglement (depending on η) is present. We explicitly identify the occurrence of increasing multi-partite entanglement in Shor's algorithm. Our results do not ap…
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.
This paper gives a criterion for detecting the entanglement of a quantum state, and uses it to study the relationship between topological and quantum entanglement. It is fundamental to view topological entanglements such as braids as entanglement operators and to associate to them unitary operators that are capable of creating quantum entanglement. The entanglement criterion is used to explore this connection. The paper discusses non-locality in the light of this criterion.
Entanglement is an essential resource in current experimental implementations for quantum information processing. We review a class of experiments exploiting photonic entanglement, ranging from one-way quantum computing over quantum communication complexity to long-distance quantum communication. We then propose a set of feasible experiments that will underline the advantages of photonic entanglement for quantum information processing.
We consider the standard quantum teleportation protocol where a general bipartite state is used as entanglement resource. We use the entanglement fidelity to describe how well the standard quantum teleportation channel transmits quantum entanglement and give a simple expression for the entanglement fidelity when it is averaged on all input states.
We point out that density matrices can only be used to describe quantum states, so the entanglement contained in a density matrix is just quantum entanglement. This means a bipartite state described by a density matrix contains quantum entanglement, unless the density matrix has the form $ρ_{AB}=ρ_A\otimes ρ_B$.
Three inter-related topics are discussed here. One, the Lindblad dynamics of quantum dissipative systems; two, quantum entanglement in composite systems and its quantification based on the Tsallis entropy; and three, robustness of entanglement under dissipation. After a brief review of the Lindblad theory of quantum dissipative systems and the idea of quantum entanglement in composite quantum systems illustrated by describing the three particle systems, the behavior of entanglement under the influence of dissipative processes is discussed. These issues are of importance in the discussion of qu…
We simulate entanglement sharing between two end-nodes of a quantum network using SeQUeNCe, an open-source simulation package for quantum networks. Our focus is on the rate of entanglement generation between the end-nodes with many repeaters with a finite quantum memory lifetime. Our findings demonstrate that the performance of quantum connection depends highly on the entanglement management protocol scheduling entanglement generation and swapping, resulting in the final end-to-end entanglement. Numerical and analytical simulations show limits of connection performance for a given number of re…
Quantum transduction refers to the coherent conversion between microwave and optical states, which can be achieved by quantum teleportation if given high fidelity microwave-optical entanglement, namely entanglement-based quantum transduction. Reliable microwave-optical entanglement can be generated using various platforms. In this paper, we base the discussion on piezo-optomechanical system and make the teleportation induced conversion scheme more concrete in the framework of quantum channel theory. By comparing the quantum capacity between the entanglement-based conversion channel and the tra…
We show that bipartite entanglement distribution (or entanglement of assistance) in multipartite quantum systems is by nature polygamous. We first provide an analytic upper bound for the concurrence of assistance in bipartite quantum systems, and derive a polygamy inequality of multipartite entanglement in arbitrary dimensional quantum systems.
We consider quantum computing with pseudo-pure states. This framework arises in certain implementations of quantum computing using NMR. We analyze quantum computational protocols which aim to solve exponential classical problems with polynomial resources and ask whether or not entanglement of the pseudo-pure states is needed to achieve this aim. We show that for a large class of such protocols, including Shor's factorization, entanglement is necessary. We also show that achieving entanglement is not sufficient: if the noise in the state is sufficiently large, exponential resources are needed e…
We show that the various intermediate states appearing in the process of one-way computation at a given step of measurement are all equivalent modulo local unitary transformations. This implies, in particular, that all those intermediate states share the same entanglement irrespective of the measurement outcomes, indicating that the process of one-way computation is essentially unique with respect to local quantum operations.
We review the criteria for separability and quantum entanglement, both in a bipartite as well as a multipartite setting. We discuss Bell inequalities, entanglement witnesses, entropic inequalities, bound entanglement and several features of multipartite entanglement. We indicate how these criteria bear on the experimental detection of quantum entanglement.
We provide several formulas that determine the optimal number of entangled bits (ebits) that a general entanglement-assisted quantum code requires. Our first theorem gives a formula that applies to an arbitrary entanglement-assisted block code. Corollaries of this theorem give formulas that apply to a code imported from two classical binary block codes, to a code imported from a classical quaternary block code, and to a continuous-variable entanglement-assisted quantum block code. Finally, we conjecture two formulas that apply to entanglement-assisted quantum convolutional codes.
In a quantum computation with pure states, the generation of large amounts of entanglement is known to be necessary for a speedup with respect to classical computations. However, examples of quantum computations with mixed states are known, such as the deterministic computation with one quantum qubit (DQC1) model [Knill and Laflamme, Phys. Rev. Lett. 81, 5672 (1998)], in which entanglement is at most marginally present, and yet a computational speedup is believed to occur. Correlations, and not entanglement, have been identified as a necessary ingredient for mixed-state quantum computation spe…
Entanglement measures quantify the amount of quantum entanglement that is contained in quantum states. Typically, different entanglement measures do not have to be partially ordered. The presence of a definite partial order between two entanglement measures for all quantum states, however, allows for meaningful conceptualization of sensitivity to entanglement, which will be greater for the entanglement measure that produces the larger numerical values. Here, we have investigated the partial order between the normalized versions of four entanglement measures based on Schmidt decomposition of bi…
We discuss maximum entangled states of quantum systems in terms of quantum fluctuations of all essential measurements responsible for manifestation of entanglement. Namely, we consider maximum entanglement as a property of states, for which quantum fluctuations come to their extreme.
Twenty-five years after the invention of quantum teleportation, the concept of entanglement gained enormous popularity. This is especially nice to those who remember that entanglement was not even taught at universities until the 1990's. Today, entanglement is often presented as a resource, the resource of quantum information science and technology. However, entanglement is exploited twice in quantum teleportation. First, entanglement is the `quantum teleportation channel', i.e. entanglement between distant systems. Second, entanglement appears in the eigenvectors of the joint measurement that…
Entanglement of quantum variables is usually thought to be a prerequisite for obtaining quantum speed-ups of information processing tasks such as searching databases. This paper presents methods for quantum search that give a speed-up over classical methods, but that do not require entanglement. These methods rely instead on interference to provide a speed-up. Search without entanglement comes at a cost: although they outperform analogous classical devices, the quantum devices that perform the search are not universal quantum computers and require exponentially greater overhead than a quantum …
Quantum measurement is a class of quantum channels that sends quantum states to classical states. We set up resource theories of quantum coherence and quantum entanglement for quantum measurements and find relations between them. For this, we conceive a relative entropy type quantity to account for the quantum resources of quantum measurements. The quantum coherence of a quantum measurement can be converted into the entanglement in a bipartite quantum measurement through coherence-non generating transformations. Conversely, a quantum entanglement monotone of quantum measurements induces a quan…
We investigate the average bipartite entanglement, over all possible divisions of a multipartite system, as a useful measure of multipartite entanglement. We expose a connection between such measures and quantum-error-correcting codes by deriving a formula relating the weight distribution of the code to the average entanglement of encoded states. Multipartite entangling power of quantum evolutions is also investigated.
We study the Bell nonlocality of high dimensional quantum systems based on quantum entanglement. A quantitative relationship between the maximal expectation value B of Bell operators and the quantum entanglement concurrence C is obtained for even dimension pure states, with the upper and lower bounds of B governed by C.
We examine several well known quantum spin models and categorize behavior of pairwise entanglement at quantum phase transitions. A unified picture on the connection between the entanglement and quantum phase transition is given.
PhD thesis (University of York). The thesis covers in a unified way the material presented in quant-ph/0403073, quant-ph/0502040, quant-ph/0504160, quant-ph/0510035, quant-ph/0512012 and quant-ph/0603283. It includes two large review chapters on entanglement and distillation.
We study entanglement properties of all eigenstates of the Heisenberg XXX model, and find that the entanglement and mixedness for a pair of nearest-neighbor qubits are completely determined by the corresponding eigenenergies. Specifically, the negativity of the eigenenergy implies pairwise entanglement. From the relation between entanglement and eigenenergy, we obtain finite-size behaviors of the entanglement. We also study entanglement and mixedness versus energy in the quantum Heisenberg XY model.
With Hubbard model, the entanglement scaling behavior in a two-dimensional itinerant system is investigated. It has been found that, on the two sides of the critical point denoting an inherent quantum phase transition (QPT), the entanglement follows different scalings with the size just as an order parameter does. This fact reveals the subtle role played by the entanglement in QPT as a fungible physical resource.
Comment on "Quantum Interferometric Optical Lithography: Exploiting Entanglement to Beat the Diffraction Limit" The effective absorption rates in quantum lithography are very low.
The entanglement of formation gives a necessary and sufficient condition for the existence of a perfect quantum error correction procedure.
Genuine multipartite entanglement plays important roles in quantum information processing. The detection of genuine multipartite entanglement has been long time a challenging problem in the theory of quantum entanglement. We propose a criterion for detecting genuine tripartite entanglement of arbitrary dimensional tripartite states based on quantum Fisher information. We show that this criterion is more effective for some states in detecting genuine tripartite entanglement by detailed example.
The non-Markovian dynamics of quantum entanglement is studied by the Shabani-Lidar master equation when one of entangled quantum systems is coupled to a local reservoir with memory effects. The completely positive reduced dynamical map can be constructed in the Kraus representation. Quantum entanglement decays more slowly in the non-Markovian environment. The decoherence time for quantum entanglement can be markedly increased by the change of the memory kernel. It is found out that the entanglement sudden death between quantum systems and entanglement sudden birth between the system and reserv…
Recently, there have been several suggestions that weak Kerr nonlinearity can be used for generation of macroscopic superpositions and entanglement and for linear optics quantum computation. However, it is not immediately clear that this approach can overcome decoherence effects. Our numerical study in this paper shows that nonlinearity of weak strength could be useful for macroscopic entanglement generation and quantum gate operations in the presence of decoherence. We suggest specific values for real experiments based on our analysis. Our discussion shows that the generation of macroscopic e…
We show that the ability to create entanglement is necessary for execution of bipartite quantum gates even when they are applied to unentangled states and create no entanglement. Starting with a simple example we demonstrate that to execute such a gate bi-locally the local operations and classical communications (LOCC) should be supplemented by shared entanglement. Our results point to the changes in quantum discord, which is a measure of quantumness of correlations even in the absence of entanglement, as the indicator of failure of a LOCC implementation of the gates.
The quantum entanglement is considered as one of the most important notions of quantum computing. The entanglement is a feature of quantum systems and it is used as a basis for many quantum algorithms and protocols. In this paper we analyze the level of entanglement for the quantum switch, during its work. The level of entanglement during the correct operating may be compared with the situation when a noise is present in the analyzed system. The noise changes the level of quantum entanglement and we utilize this observation to evaluate if the switch works properly. We present the formulae desc…
Quantum entanglement is a critical resource for quantum information and quantum computation. However, entanglement of a quantum system is subjected to change due to the interaction with the environment. One typical result of the interaction is the amplitude damping that usually results in the reduction of the entanglement. Here we propose a protocol to protect quantum entanglement from the amplitude damping by applying Hadamard and CNOT gates. As opposed to some recently studied methods, the scheme presented here does not require weak measurement in the reversal process, leading to a faster re…
We provide a sufficient condition for the monogamy inequality of multi-party quantum entanglement of arbitrary dimensions in terms of entanglement of formation. Based on the classical-classical-quantum(ccq) states whose quantum parts are obtained from the two-party reduced density matrices of a three-party quantum state, we show the additivity of the mutual information of the ccq states guarantees the monogamy inequality of the three-party pure state in terms of EoF. After illustrating the result with some examples, we generalize our result of three-party systems into any multi-party systems o…
The entanglement measure for multiqudits is proposed. This measure calculates the partial entanglement distributed by subsystems and the complete entanglement of the total system. This shows that we need to measure the subsystem entanglements to explain the full description for multiqudit entanglement. Furthermore, we extend the entanglement measure to mixed multiqubits and the higher dimension Hilbert spaces.
This is a thesis submitted to university of Pune, India, for the Ph.D. degree. This work deals with entanglement production in two qubit, two qutrit and three qubit systems, entanglement in indistinguishable fermionic systems, quantum discord in a Heisenberg chain and geometric measure of quantum discord in an arbitrary state of a bipartite quantum system.
The entanglement fidelity provides a measure of how well the entanglement between two subsystems is preserved in a quantum process. By using a simple model we show that in some cases this quantity in its original definition fails in the measurement of the entanglement preserving. On the contrary, the modified entanglement fidelity, obtained by using a proper local unitary transformation on a subsystem, is shown to exhibit the behavior similar to that of the concurrence in the quantum evolution.
I explore entanglement dynamics in examples of quantum memories, decoherence free subspaces (DFS) and noiseless subsystems (NS), to determine how a complete loss of entanglement affects the ability of these techniques to protect quantum information. Using negativity and concurrence as entanglement measures, I find that in general there is no correlation between the complete loss of entanglement in the system and the fidelity of the stored quantum information. These results complement previous results in which quantum protocols not explictly based on entanglement exhibit little correlation betw…
We give a review on entanglement purification for bipartite and multipartite quantum states, with the main focus on theoretical work carried out by our group in the last couple of years. We discuss entanglement purification in the context of quantum communication, where we emphasize its close relation to quantum error correction. Various bipartite and multipartite entanglement purification protocols are discussed, and their performance under idealized and realistic conditions is studied. Several applications of entanglement purification in quantum communication and computation are presented, w…
We show how entanglement shared between encoder and decoder can simplify the theory of quantum error correction. The entanglement-assisted quantum codes we describe do not require the dual-containing constraint necessary for standard quantum error correcting codes, thus allowing us to ``quantize'' all of classical linear coding theory. In particular, efficient modern classical codes that attain the Shannon capacity can be made into entanglement-assisted quantum codes attaining the hashing bound (closely related to the quantum capacity). For systems without large amounts of shared entanglement,…
Entanglement constitutes a key characteristic feature of quantum matter. Its detection, however, still faces major challenges. In this letter, we formulate a framework for probing entanglement based on machine learning techniques. The central element is a protocol for the generation of statistical images from quantum many-body states, with which we perform image classification by means of convolutional neural networks. We show that the resulting quantum entanglement recognition task is accurate and can be assigned a well-controlled error across a wide range of quantum states. We discuss the po…
Multipartite entanglement is of important resources for quantum communication and quantum computation. Our goal in this paper is to characterize general multipartite entangled states according to shallow quantum circuits. We firstly prove any genuinely multipartite entanglement on finite-dimensional spaces can be generated by using 2-layer shallow quantum circuit consisting of two biseparable quantum channels, which the smallest nontrivial circuit depth in the shallow quantum circuit model. We further propose a semi-device-independent entanglement model depending on the local connection abilit…
We study the exact entanglement dynamics of two atoms in a lossy resonator. Besides discussing the steady-state entanglement, we show that in the strong coupling regime the system-reservoir correlations induce entanglement revivals and oscillations and propose a strategy to fight against the deterioration of the entanglement using the quantum Zeno effect.
Quantum interface links stationary qubits in quantum memory with flying photonic qubits in optical transmission channels and constitutes a critical element for future quantum internet. Entanglement of quantum interfaces is a key step for realization of quantum networks. Through heralded detection of photon interference, here we generate multipartite entanglement between 25 (or 9) individually addressable quantum interfaces in a multiplexed atomic quantum memory array and confirm genuine 22 (or 9) partite entanglement, respectively. Experimental entanglement of a record-high number of quantum i…
We {characterize the multipartite entanglement in a quantum system by the quantity} which vanishes if only the quantum system may be decomposed into two weakly entangled subsystems, unlike measures of multipartite entanglement introduced before. We refer to this {quantity} as the minimal entanglement of bipartite decompositions (MEBD). Big MEBD means that the system may not be decomposed into two weakly entangled subsystems. MEBD allows one to define, for instance, whether the given quantum system may be a candidate for a quantum register, where the above decomposition is undesirable. A method…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。