arXiv subjects

Hans J. Briegel

Publications and source records attributed to Hans J. Briegel.

At least 109 records · Page 6Linked to original sources

arXiv2006

Entanglement purification protocols for all graph states

We present multiparty entanglement purification protocols that are capable of purifying arbitrary graph states directly. We develop recurrence and breeding protocols and compare our methods with strategies based on bipartite entanglement purification in static and communication scenarios. We find that direct multiparty purification is of advantage with respect to achievable yields and minimal required fidelity in static scenarios, and with respect to obtainable fidelity in the case of noisy operations in both scenarios.

quant-ph↗

arXiv2006

Universal resources for measurement-based quantum computation

We investigate which entanglement resources allow universal measurement-based quantum computation via single-qubit operations. We find that any entanglement feature exhibited by the 2D cluster state must also be present in any other universal resource. We obtain a powerful criterion to assess universality of graph states, by introducing an entanglement measure which necessarily grows unboundedly with the system size for all universal resource states. Furthermore, we prove that graph states associated with 2D lattices such as the hexagonal and triangular lattice are universal, and obtain the first example of a universal non-graph state.

quant-ph↗

arXiv2006

One-way Quantum Computation - a tutorial introduction

In this book chapter, we provide a tutorial introduction to one-way quantum computation and many of the techniques one can use to understand it. The techniques which are described include the stabilizer formalism and the logical Heisenberg picture. We highlight ways in which it is useful to understand one-way computation beyond simple equivalence with the quantum circuit model. We briefly review current proposals of implementations and experimental progress and summarize some recent related theoretical developments. Although the chapter is primarily didactic in focus, we include a number of new methods and observations. These include: a simpler and more compact formulation of one-way quantum computation in the stabilizer formalism; A new way of implementing unitaries diagonal in the computational basis; New results on the family of operations which may be implemented in a single round of measurements; A method for constructing compact one-way patterns by decomposing unitaries in terms of diagonal unitaries and Clifford group transformations.

quant-ph↗

arXiv2006

Optimal purification of thermal graph states

In this paper, a purification protocol is presented and its performance is proven to be optimal when applied to a particular subset of graph states that are subject to local Z-noise. Such mixed states can be produced by bringing a system into thermal equilibrium, when it is described by a Hamiltonian which has a particular graph state as its unique ground state. From this protocol, we derive the exact value of the critical temperature above which purification is impossible, as well as the related optimal purification rates. A possible simulation of graph Hamiltonians is proposed, which requires only bipartite interactions and local magnetic fields, enabling the tuning of the system temperature.

quant-ph↗

arXiv2006

Quantum communication cost of preparing multipartite entanglement

We study the preparation and distribution of high-fidelity multi-party entangled states via noisy channels and operations. In the particular case of GHZ and cluster states, we study different strategies using bipartite or multipartite purification protocols. The most efficient strategy depends on the target fidelity one wishes to achieve and on the quality of transmission channel and local operations. We show the existence of a crossing point beyond which the strategy making use of the purification of the state as a whole is more efficient than a strategy in which pairs are purified before they are connected to the final state. We also study the efficiency of intermediate strategies, including sequences of purification and connection. We show that a multipartite strategy is to be used if one wishes to achieve high fidelity, whereas a bipartite strategy gives a better yield for low target fidelity.

quant-ph↗

arXiv2006

Two-setting Bell Inequalities for Graph States

We present Bell inequalities for graph states with high violation of local realism. In particular, we show that there is a two-setting Bell inequality for every nontrivial graph state which is violated by the state at least by a factor of two. These inequalities are facets of the convex polytope containing the many-body correlations consistent with local hidden variable models. We first present a method which assigns a Bell inequality for each graph vertex. Then for some families of graph states composite Bell inequalities can be constructed with a violation of local realism increasing exponentially with the number of qubits. We also suggest a systematic way for obtaining Bell inequalities with a high violation of local realism for arbitrary graphs.

quant-ph↗

arXiv2006

Fast simulation of stabilizer circuits using a graph state representation

According to the Gottesman-Knill theorem, a class of quantum circuits, namely the so-called stabilizer circuits, can be simulated efficiently on a classical computer. We introduce a new algorithm for this task, which is based on the graph-state formalism. It shows significant improvement in comparison to an existing algorithm, given by Gottesman and Aaronson, in terms of speed and of the number of qubits the simulator can handle. We also present an implementation.

quant-ph↗

arXiv2005

Distillation of multipartite entanglement by complementary stabilizer measurements

We propose a scheme of multipartite entanglement distillation driven by a complementary pair of stabilizer measurements, to distill directly a wider range of states beyond the stabilizer code states (such as the Greenberger-Horne-Zeilinger states). We make our idea explicit by constructing a recurrence protocol for the 3-qubit W state. Noisy W states resulting from typical decoherence can be directly purified in a few steps, if their initial fidelity is larger than a threshold. For general input mixed states, we observe distillations to hierarchical fixed points, i.e., not only to the W state but also to the 2-qubit Bell pair, depending on their initial entanglement.

quant-ph↗

arXiv2005

Multipartite entanglement in spin chains

We investigate the presence of multipartite entanglement in macroscopic spin chains. We discuss the Heisenberg and the XY model and derive bounds on the internal energy for systems without multipartite entanglement. Based on this we show that in thermal equilibrium the above mentioned spin systems contain genuine multipartite entanglement, even at finite modest temperatures.

quant-ph↗

arXiv2005

Bell Inequalities for Graph States

We investigate the non-local properties of graph states. To this aim, we derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, for each graph state there is an inequality maximally violated only by that state. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positivity of the partial transpose or the geometric measure of entanglement.

quant-ph↗

arXiv2005

Quantum Information Processing in Disordered and Complex Quantum Systems

We investigate quantum information processing and manipulations in disordered systems of ultracold atoms and trapped ions. First, we demonstrate generation of entanglement and local realization of quantum gates in a quantum spin glass system. Entanglement in such systems attains significantly high values, after quenched averaging, and has a stable positive value for arbitrary times. Complex systems with long range interactions, such as ion chains or dipolar atomic gases, can be modeled by neural network Hamiltonians. In such systems, we find the characteristic time of persistence of quenched averaged entanglement, and also find the time of its revival.

quant-ph↗

arXiv2004

Local invariants for multi-partite entangled states allowing for a simple entanglement criterion

We present local invariants of multi-partite pure or mixed states, which can be easily calculated and have a straight-forward physical meaning. As an application, we derive a new entanglement criterion for arbitrary mixed states of $n$ parties. The new criterion is weaker than the partial transposition criterion but offers advantages for the study of multipartite systems. A straightforward generalization of these invariants allows for the construction of a complete set of observable polynomial invariants.

quant-ph↗

arXiv2002

Quantum Communication and Decoherence

In this contribution we will give a brief overview on the methods used to overcome decoherence in quantum communication protocols. We give an introduction to quantum error correction, entanglement purification and quantum cryptography. It is shown that entanglement purification can be used to create ``private entanglement'', which makes it a useful tool for cryptographic protocols.

quant-ph↗

arXiv2001

Private entanglement over arbitrary distances, even using noisy apparatus

We give a security proof of quantum cryptography based entirely on entanglement purification. Our proof applies to all possible attacks (individual and coherent). It implies the security of cryptographic keys distributed with the help of entanglement-based quantum repeaters. We prove the security of the obtained quantum channel which may not only be used for quantum key distribution, but also for secure, albeit noisy, transmission of quantum information.

quant-ph↗

arXiv2001

A security proof of quantum cryptography based entirely on entanglement purification

We give a proof that entanglement purification, even with noisy apparatus, is sufficient to disentangle an eavesdropper (Eve) from the communication channel. In the security regime, the purification process factorises the overall initial state into a tensor-product state of Alice and Bob, on one side, and Eve on the other side, thus establishing a completely private, albeit noisy, quantum communication channel between Alice and Bob. The security regime is found to coincide for all practical purposes with the purification regime of a two-way recurrence protocol. This makes two-way entanglement purification protocols, which constitute an important element in the quantum repeater, an efficient tool for secure long-distance quantum cryptography.

quant-ph↗

arXiv2001

The one-way quantum computer -- a non-network model of quantum computation

A one-way quantum computer works by only performing a sequence of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. No non-local operations are required in the process of computation. Any quantum logic network can be simulated on the one-way quantum computer. On the other hand, the network model of quantum computation cannot explain all ways of processing quantum information possible with the one-way quantum computer. In this paper, two examples of the non-network character of the one-way quantum computer are given. First, circuits in the Clifford group can be performed in a single time step. Second, the realisation of a particular circuit -- the bit-reversal gate -- on the one-way quantum computer has no network interpretation. (Submitted to J. Mod. Opt, Gdansk ESF QIT conference issue.)

quant-ph↗

arXiv2001

Entanglement purification with noisy apparatus can be used to factor out an eavesdropper

We give a proof that entanglement purification, even with noisy apparatus, is sufficient to disentangle an eavesdropper (Eve) from the communication channel. Our proof applies to all possible attacks (individual and coherent). Due to the quantum nature of the entanglement purification protocol, it is also possible to use the obtained quantum channel for secure transmission of quantum information.

quant-ph↗

arXiv2000

Quantum computing via measurements only

A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of these systems to a large number of qubits, essential for practical applications such as the Shor algorithm, represents a formidable challenge. Most of the current experiments are designed to implement sequences of highly controlled interactions between selected particles (qubits), thereby following models of a quantum computer as a (sequential) network of quantum logic gates. Here we propose a different model of a scalable quantum computer. In our model, the entire resource for the quantum computation is provided initially in form of a specific entangled state (a so-called cluster state) of a large number of qubits. Information is then written onto the cluster, processed, and read out form the cluster by one-particle measurements only. The entangled state of the cluster thus serves as a universal substrate for any quantum computation. Cluster states can be created efficiently in any system with a quantum Ising-type interaction (at very low temperatures) between two-state particles in a lattice configuration.

quant-ph↗