arXiv subjects

Artur Ekert

Publications and source records attributed to Artur Ekert.

At least 37 records · Page 2Linked to original sources

arXiv2004

Experimental Demonstration of Quantum State Multi-meter and One-qubit Fingerprinting in a Single Quantum Device

We experimentally demonstrate in NMR a quantum interferometric multi-meter for extracting certain properties of unknown quantum states without resource to quantum tomography. It can perform direct state determinations, eigenvalue/eigenvector estimations, purity tests of a quantum system, as well as the overlap of any two unknown quantum states. Using the same device, we also demonstrate one-qubit quantum fingerprinting.

quant-ph↗

arXiv2004

Mirror Inversion of Quantum States in Linear Registers

Transfer of data in linear quantum registers can be significantly simplified with pre-engineered but not dynamically controlled inter-qubit couplings. We show how to implement a mirror inversion of the state of the register in each excitation subspace with respect to the centre of the register. Our construction is especially appealing as it requires no dynamical control over individual inter-qubit interactions. If, however, individual control of the interactions is available then the mirror inversion operation can be performed on any substring of qubits in the register. In this case a sequence of mirror inversions can generate any permutation of a quantum state of the involved qubits.

quant-ph↗

arXiv2004

Perfect Transfer of Arbitrary States in Quantum Spin Networks

We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to $N$-qubit spin networks of identical qubit couplings, we show that $2\log_3 N$ is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. This paper expands and extends the work done in PRL 92, 187902.

quant-ph↗

arXiv2004

Experimental Quantum Cloning with Prior Partial Information

When prior partial information about a state to be cloned is available, it can be cloned with a fidelity higher than that of universal quantum cloning. We experimentally verify this intriguing relationship between the cloning fidelity and the prior information by reporting the first experimental optimal quantum state-dependent cloning, using nuclear magnetic resonance techniques. Our experiments may further have important implications into many quantum information processing protocols.

quant-ph↗

arXiv2004

Perfect state transfer in quantum spin networks

We propose a class of qubit networks that admit perfect transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin networks of identical qubit couplings, we show that 2 log_3 N is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain.

quant-ph↗

arXiv2004

A Generic Security Proof for Quantum Key Distribution

Quantum key distribution allows two parties, traditionally known as Alice and Bob, to establish a secure random cryptographic key if, firstly, they have access to a quantum communication channel, and secondly, they can exchange classical public messages which can be monitored but not altered by an eavesdropper, Eve. Quantum key distribution provides perfect security because, unlike its classical counterpart, it relies on the laws of physics rather than on ensuring that successful eavesdropping would require excessive computational effort. However, security proofs of quantum key distribution are not trivial and are usually restricted in their applicability to specific protocols. In contrast, we present a general and conceptually simple proof which can be applied to a number of different protocols. It relies on the fact that a cryptographic procedure called privacy amplification is equally secure when an adversary's memory for data storage is quantum rather than classical.

quant-ph↗

arXiv2003

Experimental demonstration of an efficient quantum phase-covariant cloning and its possible applications to simulating eavesdropping in quantum cryptography

We describe a nuclear magnetic resonance (NMR) experiment which implements an efficient one-to-two qubit phase-covariant cloning machine(QPCCM). In the experiment we have achieved remarkably high fidelities of cloning, 0.848 and 0.844 respectively for the original and the blank qubit. This experimental value is close to the optimal theoretical value of 0.854. We have also demonstrated how to use our phase-covariant cloning machine for quantum simulations of bit by bit eavesdropping in the four-state quantum key distribution protocol.

quant-ph↗

arXiv2003

An experimental observation of geometric phases for mixed states using NMR interferometry

Examples of geometric phases abound in many areas of physics. They offer both fundamental insights into many physical phenomena and lead to interesting practical implementations. One of them, as indicated recently, might be an inherently fault-tolerant quantum computation. This, however, requires to deal with geometric phases in the presence of noise and interactions between different physical subsystems. Despite the wealth of literature on the subject of geometric phases very little is known about this very important case. Here we report the first experimental study of geometric phases for mixed quantum states. We show how different they are from the well understood, noiseless, pure-state case.

quant-ph↗

arXiv2003

Tomographic Quantum Cryptography: Equivalence of Quantum and Classical Key Distillation

The security of a cryptographic key that is generated by communication through a noisy quantum channel relies on the ability to distill a shorter secure key sequence from a longer insecure one. For an important class of protocols, which exploit tomographically complete measurements on entangled pairs of any dimension, we show that the noise threshold for classical advantage distillation is identical with the threshold for quantum entanglement distillation. As a consequence, the two distillation procedures are equivalent: neither offers a security advantage over the other.

quant-ph↗

arXiv2001

Direct detection of quantum entanglement

Quantum entanglement, after playing a significant role in the development of the foundations of quantum mechanics, has been recently rediscovered as a new physical resource with potential commercial applications such as, for example, quantum cryptography, better frequency standards or quantum-enhanced positioning and clock synchronization. On the mathematical side the studies of entanglement have revealed very interesting connections with the theory of positive maps. The capacity to generate entangled states is one of the basic requirements for building quantum computers. Hence, efficient experimental methods for detection, verification and estimation of quantum entanglement are of great practical importance. Here, we propose an experimentally viable, \emph{direct} detection of quantum entanglement which is efficient and does not require any \emph{a priori} knowledge about the quantum state. In a particular case of two entangled qubits it provides an estimation of the amount of entanglement. We view this method as a new form of quantum computation, namely, as a decision problem with quantum data structure.

quant-ph↗

arXiv2000

Basic concepts in quantum computation

Section headings: 1 Qubits, gates and networks 2 Quantum arithmetic and function evaluations 3 Algorithms and their complexity 4 From interferometers to computers 5 The first quantum algorithms 6 Quantum search 7 Optimal phase estimation 8 Periodicity and quantum factoring 9 Cryptography 10 Conditional quantum dynamics 11 Decoherence and recoherence 12 Concluding remarks

quant-ph↗

arXiv2000

Geometric phases for mixed states in interferometry

We provide a physical prescription based on interferometry for introducing the total phase of a mixed state undergoing unitary evolution, which has been an elusive concept in the past. We define the parallel transport condition that provides a connection-form for obtaining the geometric phase for mixed states. The expression for the geometric phase for mixed state reduces to well known formulas in the pure state case when a system undergoes noncyclic and unitary quantum evolution.

quant-ph↗

arXiv1999

Machines, Logic and Quantum Physics

Though the truths of logic and pure mathematics are objective and independent of any contingent facts or laws of nature, our knowledge of these truths depends entirely on our knowledge of the laws of physics. Recent progress in the quantum theory of computation has provided practical instances of this, and forces us to abandon the classical view that computation, and hence mathematical proof, are purely logical notions independent of that of computation as a physical process. Henceforward, a proof must be regarded not as an abstract object or process but as a physical process, a species of computation, whose scope and reliability depend on our knowledge of the physics of the computer concerned.

math.HO↗

arXiv1999

The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer

A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and `hidden' or `unknown' subgroups of Abelian groups. It is already known how to phrase the first four problems as the estimation of eigenvalues of certain unitary operators. Here we show how the solution to the more general Abelian `hidden subgroup problem' can also be described and analysed as such. We then point out how certain instances of these problems can be solved with only one control qubit, or `flying qubits', instead of entire registers of control qubits.

quant-ph↗

arXiv1998

Quantum Algorithms: Entanglement Enhanced Information Processing

We discuss the fundamental role of entanglement as the essential nonclassical feature providing the computational speed-up in the known quantum algorithms. We review the construction of the Fourier transform on an Abelian group and the principles underlying the fast Fourier transform algorithm. We describe the implementation of the FFT algorithm for the group of integers modulo 2^n in the quantum context, showing how the group-theoretic formalism leads to the standard quantum network and identifying the property of entanglement that gives rise to the exponential speedup (compared to the classical FFT). Finally we outline the use of the Fourier transform in extracting periodicities, which underlies its utility in the known quantum algorithms.

quant-ph↗

arXiv1997

Quantum Algorithms Revisited

Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum computation is viewed as multi-particle interference. We use this approach to review (and improve) some of the existing quantum algorithms and to show how they are related to different instances of quantum phase estimation. We provide an explicit algorithm for generating any prescribed interference pattern with an arbitrary precision.

quant-ph↗

arXiv1997

Universal Algorithm for Optimal Estimation of Quantum States from Finite Ensembles

We present a universal algorithm for the optimal quantum state estimation of an arbitrary finite dimensional system. The algorithm specifies a physically realizable positive operator valued measurement (POVM) on a finite number of identically prepared systems. We illustrate the general formalism by applying it to different scenarios of the state estimation of N independent and identically prepared two-level systems (qubits).

quant-ph↗

arXiv1997

From quantum-codemaking to quantum code-breaking

This is a semi-popular overview of quantum entanglement as an important physical resource in the field of data security and quantum computing. After a brief outline of entanglement's key role in philosophical debates about the meaning of quantum mechanics I describe its current impact on both cryptography and cryptanalysis. The paper is based on the lecture given at the conference "Geometric Issues in the Foundations of Science" (Oxford, June 1996) in honor of Roger Penrose.

quant-ph↗