Searcharxiv⌕ Search

arXiv subjects

Wolfgang Dür

Publications and source records attributed to Wolfgang Dür.

83 records · Page 5Linked to original sources

Stability of encoded macroscopic quantum superpositions

The multipartite Greenberger-Horne-Zeilinger (GHZ) state is a paradigmatic example of a highly entangled multipartite states with distinct quantum features. However, the GHZ state is very sensitive to generic decoherence processes, where its quantum features and in particular its entanglement diminish rapidly, thereby hindering possible practical applications e.g. in the context of quantum metrology. In this paper, we discuss GHZ-like quantum states with a block-local structure and show that they exhibit a drastically increased stability against noise for certain choices of block-encoding. We analyze in detail the decay of the interference terms, the entanglement in terms of distillable entanglement and Negativity as well as the notion of macroscopicity as measured by the so-called q-index, and provide general bounds on these quantities. We focus on an encoding where logical qubits are themselves encoded as GHZ states, which leads to so-called concatenated GHZ (C-GHZ) states. We compare the stability of C-GHZ states with other types of encodings, thereby showing the superior stability of the C-GHZ states. Analytic results are complemented by numerical studies, where tensor network techniques are used to investigate the quantum properties of multipartite entangled states under the influence of decoherence.

quant-ph↗

The U(1) Lattice Gauge Theory Universally Connects All Classical Models with Continuous Variables, Including Background Gravity

We show that the partition function of many classical models with continuous degrees of freedom, e.g. abelian lattice gauge theories and statistical mechanical models, can be written as the partition function of an (enlarged) four-dimensional lattice gauge theory (LGT) with gauge group U(1). This result is very general that it includes models in different dimensions with different symmetries. In particular, we show that a U(1) LGT defined in a curved spacetime can be mapped to a U(1) LGT with a flat background metric. The result is achieved by expressing the U(1) LGT partition function as an inner product between two quantum states.

quant-ph↗

Universal quantum computer from a quantum magnet

We show that a local Hamiltonian of spin-3/2 particles with only two-body nearest-neighbor Affleck-Kennedy-Lieb-Tasaki and exchange-type interactions has an unique ground state, which can be used to implement universal quantum computation merely with single-spin measurements. We prove that the Hamiltonian is gapped, independent of the system size. Our result provides a further step towards utilizing systems with condensed matter-type interactions for measurement-based quantum computation.

quant-ph↗

Completeness of classical spin models and universal quantum computation

We study mappings between distinct classical spin systems that leave the partition function invariant. As recently shown in [Phys. Rev. Lett. 100, 110501 (2008)], the partition function of the 2D square lattice Ising model in the presence of an inhomogeneous magnetic field, can specialize to the partition function of any Ising system on an arbitrary graph. In this sense the 2D Ising model is said to be "complete". However, in order to obtain the above result, the coupling strengths on the 2D lattice must assume complex values, and thus do not allow for a physical interpretation. Here we show how a complete model with real -and, hence, "physical"- couplings can be obtained if the 3D Ising model is considered. We furthermore show how to map general q-state systems with possibly many-body interactions to the 2D Ising model with complex parameters, and give completeness results for these models with real parameters. We also demonstrate that the computational overhead in these constructions is in all relevant cases polynomial. These results are proved by invoking a recently found cross-connection between statistical mechanics and quantum information theory, where partition functions are expressed as quantum mechanical amplitudes. Within this framework, there exists a natural correspondence between many-body quantum states that allow universal quantum computation via local measurements only, and complete classical spin systems.

quant-ph↗

A variational method based on weighted graph states

In a recent article [Phys. Rev. Lett. 97 (2006), 107206], we have presented a class of states which is suitable as a variational set to find ground states in spin systems of arbitrary spatial dimension and with long-range entanglement. Here, we continue the exposition of our technique, extend from spin 1/2 to higher spins and use the boson Hubbard model as a non-trivial example to demonstrate our scheme.

quant-ph↗

Quantum simulation of interacting high-dimensional systems: the influence of noise

We consider the simulation of interacting high-dimensional systems using pairwise interacting qubits. The main tool in this context is the generation of effective many-body interactions, and we examine a number of different protocols for obtaining them. These methods include the usage of higher-order processes (commutator method), unitary conjugation or graph state encoding, as well as teleportation based approaches. We illustrate and compare these methods in detail and analyze the time cost for simulation. In the second part of the article, we investigate the influence of noise on the simulation process. We concentrate on errors in the interaction Hamiltonians and consider two generic noise models, (i) timing errors in pairwise interactions and (ii) noisy pairwise interactions described by Master equations of Lindblad form. We analyze and compare the effect of noise for the different simulation methods and propose a way to significantly reduce the influence of noise by making use of entanglement purification together with a teleportation based protocol.

quant-ph↗

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↗

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↗

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↗

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↗

On the effective size of certain "Schrödinger cat'' like states

Several experiments and experimental proposals for the production of macroscopic superpositions naturally lead to states of the general form $|ϕ_1>^{\otimes N}+|ϕ_2>^{\otimes N}$, where the number of subsystems $N$ is very large, but the states of the individual subsystems have large overlap, $|łϕ_1|ϕ_2 \r|^2=1-ε^2$. We propose two different methods for assigning an effective particle number to such states, using ideal Greenberger--Horne--Zeilinger (GHZ)-- states of the form $|0\r^{\otimes n}+|1\r^{\otimes n}$ as a standard of comparison. The two methods are based on decoherence and on a distillation protocol respectively. Both lead to an effective size $n$ of the order of $N ε^2$.

quant-ph↗