SearcharxivSearch

arXiv subjects

A. Ekert

Publications and source records attributed to A. Ekert.

At least 19 recordsLinked to original sources

Decoherence-assisted transport in quantum networks

It is shown that energy transfer in a homogeneous fully connected quantum network is assisted by a decohering interaction with environmental spins. Analytic expressions for the transfer probabilities are obtained for the zero temperature case, and the effect is shown to persist at physiological temperatures. This model of decoherence-assisted energy transfer is applied to the Fenna-Matthews-Olson complex.

quant-ph

Decoherence assisted transport in a dimer system

The dynamics of a dimer coupled to two different environments each in a spin star configuration under the influence of decoherence is studied. The exact analytical expression for the transition probability in the dimer system is obtained for different situations, i.e., independent and correlated environments. In all cases considered, it is shown that there exist well-defined ranges of parameters for which decoherent interaction with the environment assists energy transfer in the dimer system. In particular, we find that correlated environments can assist energy transfer more efficiently than separate baths.

quant-ph

Staying adiabatic with unknown energy gap

We introduce an algorithm to perform an optimal adiabatic evolution that operates without an apriori knowledge of the system spectrum. By probing the system gap locally, the algorithm maximizes the evolution speed, thus minimizing the total evolution time. We test the algorithm on the Landau-Zener transition and then apply it on the quantum adiabatic computation of 3-SAT: The result is compatible with an exponential speed-up for up to twenty qubits with respect to classical algorithms. We finally study a possible algorithm improvement by combining it with the quantum Zeno effect.

quant-ph

Optimal quantum circuits for general phase estimation

We address the problem of estimating the phase phi given N copies of the phase rotation gate u(phi). We consider, for the first time, the optimization of the general case where the circuit consists of an arbitrary input state, followed by any arrangement of the N phase rotations interspersed with arbitrary quantum operations, and ending with a POVM. Using the polynomial method, we show that, in all cases where the measure of quality of the estimate phi' for phi depends only on the difference phi'-phi, the optimal scheme has a very simple fixed form. This implies that an optimal general phase estimation procedure can be found by just optimizing the amplitudes of the initial state.

quant-ph

Quantum Physics from A to Z

This is a collection of statements gathered on the occasion of the Quantum Physics of Nature meeting in Vienna.

quant-ph

Multipartite entanglement in quantum spin chains

We study the occurrence of multipartite entanglement in spin chains. We show that certain genuine multipartite entangled states, namely W states, can be obtained as ground states of simple XX type ferromagnetic spin chains in a transverse magnetic field, for any number of sites. Moreover, multipartite entanglement is proven to exist even at finite temperatures. A transition from a product state to a multipartite entangled state occurs when decreasing the magnetic field to a critical value. Adiabatic passage through this point can thus lead to the generation of multipartite entanglement.

quant-ph

Optimal State Discrimination Using Particle Statistics

We present an application of particle statistics to the problem of optimal ambiguous discrimination of quantum states. The states to be discriminated are encoded in the internal degrees of freedom of identical particles, and we use the bunching and antibunching of the external degrees of freedom to discriminate between various internal states. We show that we can achieve the optimal single-shot discrimination probability using only the effects of particle statistics. We discuss interesting applications of our method to detecting entanglement and purifying mixed states. Our scheme can easily be implemented with the current technology.

quant-ph

Experimental detection of entanglement via witness operators and local measurements

In this paper we address the problem of detection of entanglement using only few local measurements when some knowledge about the state is given. The idea is based on an optimized decomposition of witness operators into local operators. We discuss two possible ways of optimizing this local decomposition. We present several analytical results and estimates for optimized detection strategies for NPT states of 2x2 and NxM systems, entangled states in 3 qubit systems, and bound entangled states in 3x3 and 2x4 systems.

quant-ph

Detection of entanglement with few local measurements

We introduce a general method for the experimental detection of entanglement by performing only few local measurements, assuming some prior knowledge of the density matrix. The idea is based on the minimal decomposition of witness operators into a pseudo-mixture of local operators. We discuss an experimentally relevant case of two qubits, and show an example how bound entanglement can be detected with few local measurements.

quant-ph

Reply to `Singularities of the mixed state phase'

The only difference between Bhandari's viewpoint [quant-ph/0108058] and ours [Phys. Rev. Lett. 85, 2845 (2000)] is that our phase is defined modulo $2π$, whereas Bhandari argues that two phases that differ by $2πn$, $n$ integer, may be distinguished experimentally in a history-dependent manner.

quant-ph

Toward scalable quantum computation with cavity QED systems

We propose a scheme for quantum computing using high-Q cavities in which the qubits are represented by single cavity modes restricted in the space spanned by the two lowest Fock states. We show that single qubit operations and universal multiple qubit gates can be implemented using atoms sequentially crossing the cavities.

quant-ph

Geometric Quantum Computation

We describe in detail a general strategy for implementing a conditional geometric phase between two spins. Combined with single-spin operations, this simple operation is a universal gate for quantum computation, in that any unitary transformation can be implemented with arbitrary precision using only single-spin operations and conditional phase shifts. Thus quantum geometrical phases can form the basis of any quantum computation. Moreover, as the induced conditional phase depends only on the geometry of the paths executed by the spins it is resilient to certain types of errors and offers the potential of a naturally fault-tolerant way of performing quantum computation.

quant-ph

Geometric quantum computation with NMR

The experimental realisation of the basic constituents of quantum information processing devices, namely fault-tolerant quantum logic gates, requires conditional quantum dynamics, in which one subsystem undergoes a coherent evolution that depends on the quantum state of another subsystem. In particular, the subsystem may acquire a conditional phase shift. Here we consider a novel scenario in which this phase is of geometric rather than dynamical origin. As the conditional geometric (Berry) phase depends only on the geometry of the path executed it is resilient to certain types of errors, and offers the potential of an intrinsically fault-tolerant way of performing quantum gates. Nuclear Magnetic Resonance (NMR) has already been used to demonstrate both simple quantum information processing and Berry's phase. Here we report an NMR experiment which implements a conditional Berry phase, and thus a controlled phase shift gate. This constitutes the first elementary geometric quantum computation.

quant-ph

Against Quantum Noise

This is a brief description of how to protect quantum states from dissipation and decoherence that arise due to uncontrolled interactions with the environment. We discuss recoherence and stabilisation of quantum states based on two techniques known as "symmetrisation" and "quantum error correction". We illustrate our considerations with the most popular quantum-optical model of the system-environment interaction, commonly used to describe spontaneous emission, and show the benefits of quantum error correction in this case.

quant-ph

On Quantum Algorithms

Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle) interferometers. We show how most known quantum algorithms, including quantum algorithms for factorising and counting, may be cast in this manner. Quantum searching is described as inducing a desired relative phase between two eigenvectors to yield constructive interference on the sought elements and destructive interference on the remaining terms.

quant-ph

Distributed Quantum Computation over Noisy Channels

We analyse the use of entangled states to perform quantum computations non locally among distant nodes in a quantum network. The complexity associated with the generation of multiparticle entangled states is quantified in terms of the concept of global cost. This parameter allows us to compare the use of physical resources in different schemes. We show that for ideal channels and for a sufficiently large number of nodes, the use of maximally entangled states is advantageous over uncorrelated ones. For noisy channels, one has to use entanglement purification procedures in order to create entangled states of high fidelity. We show that under certain circumstances a quantum network supplied with a maximally entangled input still yields a smaller global cost, provided that $n$ belongs to a given interval $n\in [n_{min},n_{max}]$. The values of $n_{min}$ and $n_{max}$ crucially depend on the purification protocols used to establish the $n$-- processor entangled states, as well as on the presence of decoherence processes during the computation. The phase estimation problem has been used to illustrate this fact.

quant-ph

Optimal universal quantum cloning and state estimation

We derive a tight upper bound for the fidelity of a universal N to M qubit cloner, valid for any M \geq N, where the output of the cloner is required to be supported on the symmetric subspace. Our proof is based on the concatenation of two cloners and the connection between quantum cloning and quantum state estimation. We generalise the operation of a quantum cloner to mixed and/or entangled input qubits described by a density matrix supported on the symmetric subspace of the constituent qubits. We also extend the validity of optimal state estimation methods to inputs of this kind.

quant-ph

Optimal Universal and State-Dependent Quantum Cloning

We establish the best possible approximation to a perfect quantum cloning machine which produces two clones out of a single input. We analyze both universal and state-dependent cloners. The maximal fidelity of cloning is shown to be 5/6 for universal cloners. It can be achieved either by a special unitary evolution or by a novel teleportation scheme. We construct the optimal state-dependent cloners operating on any prescribed two non-orthogonal states, discuss their fidelities and the use of auxiliary physical resources in the process of cloning. The optimal universal cloners permit us to derive a new upper bound on the quantum capacity of the depolarizing quantum channel.

quant-ph