Searcharxiv⌕ Search

arXiv subjects

Berthold-Georg Englert

Publications and source records attributed to Berthold-Georg Englert.

At least 73 records · Page 4Linked to original sources

Adaptive schemes for incomplete quantum process tomography

We propose an iterative algorithm for incomplete quantum process tomography, with the help of quantum state estimation, based on the combined principles of maximum-likelihood and maximum-entropy. The algorithm yields a unique estimator for an unknown quantum process when one has less than a complete set of linearly independent measurement data to specify the quantum process uniquely. We apply this iterative algorithm adaptively in various situations and so optimize the amount of resources required to estimate the quantum process with incomplete data.

quant-ph↗

SeCQC: An open-source program code for the numerical Search for the classical Capacity of Quantum Channels

SeCQC is an open-source program code which implements a Numerical Search for the classical Capacity of Quantum Channels (SeCQC) by using an iterative method. Given a quantum channel, SeCQC finds the statistical operators and POVM outcomes that maximize the accessible information, and thus determines the classical capacity of the quantum channel. The optimization procedure is realized by using a steepest-ascent method that fol- lows the gradient in the POVM space, and also uses conjugate gradients for speed-up.

quant-ph↗

Quantum State Tomography with Joint SIC POMs and Product SIC POMs

We introduce random matrix theory to study the tomographic efficiency of a wide class of measurements constructed out of weighted 2-designs, including symmetric informationally complete (SIC) probability operator measurements (POMs). In particular, we derive analytic formulae for the mean Hilbert-Schmidt distance and the mean trace distance between the estimator and the true state, which clearly show the difference between the scaling behaviors of the two error measures with the dimension of the Hilbert space. We then prove that the product SIC POMs---the multipartite analogue of the SIC POMs---are optimal among all product measurements in the same sense as the SIC POMs are optimal among all joint measurements. We further show that, for bipartite systems, there is only a marginal efficiency advantage of the joint SIC POMs over the product SIC POMs. In marked contrast, for multipartite systems, the efficiency advantage of the joint SIC POMs increases exponentially with the number of parties.

quant-ph↗

SOMIM: An open-source program code for the numerical Search for Optimal Measurements by an Iterative Method

SOMIM is an open-source code that implements a Search for Optimal Measurements by using an Iterative Method. For a given set of statistical operators, SOMIM finds the POVMs that maximizes the accessed information, and thus determines the accessible information and one or all of the POVMs that retrieve it. The maximization procedure is a steepest-ascent method that follows the gradient in the POVM space, and uses conjugate gradients for speed-up.

quant-ph↗

Long-lived qubit from three spin-1/2 atoms

A system of three spin-1/2 atoms allows the construction of a reference-frame-free (RFF) qubit in the subspace with total angular momentum $j=1/2$. The RFF qubit stays coherent perfectly as long as the spins of the three atoms are affected homogeneously. The inhomogeneous evolution of the atoms causes decoherence, but this decoherence can be suppressed efficiently by applying a bias magnetic field of modest strength perpendicular to the plane of the atoms. The resulting lifetime of the RFF qubit can be many days, making RFF qubits of this kind promising candidates for quantum information storage units. Specifically, we examine the situation of three $^6\textrm{Li}$ atoms trapped in a $\textrm{CO}_2$-laser-generated optical lattice and find that, with conservatively estimated parameters, a stored qubit maintains a fidelity of 0.9999 for two hours.

quant-ph↗

Density Functional of a Two-Dimensional Gas of Dipolar Atoms: Thomas-Fermi-Dirac Treatment

We derive the density functional for the ground-state energy of a two-dimensional, spin-polarized gas of neutral fermionic atoms with magnetic-dipole interaction, in the Thomas-Fermi-Dirac approximation. For many atoms in a harmonic trap, we give analytical solutions for the single-particle spatial density and the ground-state energy, in dependence on the interaction strength, and we discuss the weak-interaction limit that is relevant for experiments. We then lift the restriction of full spin polarization and account for a time-independent inhomogeneous external magnetic field. The field strength necessary to ensure full spin polarization is derived.

cond-mat.quant-gas↗

Mutually unbiased bases in dimension six: The four most distant bases

We consider the average distance between four bases in dimension six. The distance between two orthonormal bases vanishes when the bases are the same, and the distance reaches its maximal value of unity when the bases are unbiased. We perform a numerical search for the maximum average distance and find it to be strictly smaller than unity. This is strong evidence that no four mutually unbiased bases exist in dimension six. We also provide a two-parameter family of three bases which, together with the canonical basis, reach the numerically-found maximum of the average distance, and we conduct a detailed study of the structure of the extremal set of bases.

quant-ph↗

Test-State Approach to the Quantum Search Problem

The search for "a quantum needle in a quantum haystack" is a metaphor for the problem of finding out which one of a permissible set of unitary mappings---the oracles---is implemented by a given black box. Grover's algorithm solves this problem with quadratic speed-up as compared with the analogous search for "a classical needle in a classical haystack." Since the outcome of Grover's algorithm is probabilistic---it gives the correct answer with high probability, not with certainty---the answer requires verification. For this purpose we introduce specific test states, one for each oracle. These test states can also be used to realize "a classical search for the quantum needle" which is deterministic---it always gives a definite answer after a finite number of steps---and faster by a factor of 3.41 than the purely classical search. Since the test-state search and Grover's algorithm look for the same quantum needle, the average number of oracle queries of the test-state search is the classical benchmark for Grover's algorithm.

quant-ph↗

On mutually unbiased bases

Mutually unbiased bases for quantum degrees of freedom are central to all theoretical investigations and practical exploitations of complementary properties. Much is known about mutually unbiased bases, but there are also a fair number of important questions that have not been answered in full as yet. In particular, one can find maximal sets of ${N+1}$ mutually unbiased bases in Hilbert spaces of prime-power dimension ${N=p^\m}$, with $p$ prime and $\m$ a positive integer, and there is a continuum of mutually unbiased bases for a continuous degree of freedom, such as motion along a line. But not a single example of a maximal set is known if the dimension is another composite number ($N=6,10,12,...$). In this review, we present a unified approach in which the basis states are labeled by numbers ${0,1,2,...,N-1}$ that are both elements of a Galois field and ordinary integers. This dual nature permits a compact systematic construction of maximal sets of mutually unbiased bases when they are known to exist but throws no light on the open existence problem in other cases. We show how to use the thus constructed mutually unbiased bases in quantum-informatics applications, including dense coding, teleportation, entanglement swapping, covariant cloning, and state tomography, all of which rely on an explicit set of maximally entangled states (generalizations of the familiar two--q-bit Bell states) that are related to the mutually unbiased bases. There is a link to the mathematics of finite affine planes. We also exploit the one-to-one correspondence between unbiased bases and the complex Hadamard matrices that turn the bases into each other. The ultimate hope, not yet fulfilled, is that open questions about mutually unbiased bases can be related to open questions about Hadamard matrices or affine planes, in particular the ...[rest deleted]

quant-ph↗

Hybrid Quantum Computation

We present a hybrid model of the unitary-evolution-based quantum computation model and the measurement-based quantum computation model. In the hybrid model part of a quantum circuit is simulated by unitary evolution and the rest by measurements on star graph states, thereby combining the advantages of the two standard quantum computation models. In the hybrid model, a complicated unitary gate under simulation is decomposed in terms of a sequence of single-qubit operations, the controlled-Z gates, and multi-qubit rotations around the z-axis. Every single-qubit- and the controlled-Z gate are realized by a respective unitary evolution, and every multi-qubit rotation is executed by a single measurement on a required star graph state. The classical information processing in our model only needs an information flow vector and propagation matrices. We provide the implementation of multi-control gates in the hybrid model. They are very useful for implementing Grover's search algorithm, which is studied as an illustrating example.

quant-ph↗

Structure of Two-qubit Symmetric Informationally Complete POVMs

In the four-dimensional Hilbert space, there exist 16 Heisenberg--Weyl (HW) covariant symmetric informationally complete positive operator valued measures (SIC~POVMs) consisting of 256 fiducial states on a single orbit of the Clifford group. We explore the structure of these SIC~POVMs by studying the symmetry transformations within a given SIC~POVM and among different SIC~POVMs. Furthermore, we find 16 additional SIC~POVMs by a regrouping of the 256 fiducial states, and show that they are unitarily equivalent to the original 16 SIC~POVMs by establishing an explicit unitary transformation. We then reveal the additional structure of these SIC~POVMs when the four-dimensional Hilbert space is taken as the tensor product of two qubit Hilbert spaces. In particular, when either the standard product basis or the Bell basis are chosen as the defining basis of the HW group, in eight of the 16 HW covariant SIC~POVMs, all fiducial states have the same concurrence of $\sqrt{2/5}$. These SIC~POVMs are particularly appealing for an experimental implementation, since all fiducial states can be connected to each other with just local unitary transformations. In addition, we introduce a concise representation of the fiducial states with the aid of a suitable tabular arrangement of their parameters.

quant-ph↗

Giant spin Hall conductivity in platinum at room temperature

We have demonstrated the electrical generation and detection of spin polarization by the spin Hall effect (SHE) in platinum. The experiment was performed in a non-local geometry without the use of ferromagnetic materials or magnetic field. We designed a circuit that uses the SHE to convert a charge current to a spin current, and the inverse SHE to convert the spin current back into a charge signal. The experiments were carried out for temperatures from 10 K up to 290 K. We extracted the spin Hall conductivity and spin diffusion length from the data with the aid of a spin diffusion model, and found the values of 1.1 $\times 10^6$ $Ω^{-1}$m$^{-1}$ and 80~nm, respectively, at 290 K. The spin Hall conductivity is two orders of magnitudes larger than the previous record of $3.3\times10^4$ $Ω^{-1}$m$^{-1}$. This observation may have many potential applications in spintronics devices.

cond-mat.mes-hall↗

Encoding many qubits in a rotor

We propose a scheme for encoding many qubits in a single rotor, that is, a continuous and periodic degree of freedom. A key feature of this scheme is its ability to manipulate and entangle the encoded qubits with a single operation on the system. We also show, using quantum error-correcting codes, how to protect the qubits against small errors in angular position and momentum which may affect the rotor. We then discuss the feasibility of this scheme and suggest several candidates for its implementation. The proposed scheme is immediately generalizable to qudits of any finite dimension.

quant-ph↗

Efficient quantum key distribution with trines of reference-frame-free qubits

We propose a rotationally-invariant quantum key distribution scheme that uses a pair of orthogonal qubit trines, realized as mixed states of three physical qubits. The measurement outcomes do not depend on how Alice and Bob choose their individual reference frames. The efficient key generation by two-way communication produces two independent raw keys, a bit key and a trit key. For a noiseless channel, Alice and Bob get a total of 0.573 key bits per trine state sent (98% of the Shannon limit). This exceeds by a considerable amount the yield of standard trine schemes, which ideally attain half a key bit per trine state. Eavesdropping introduces an $ε$-fraction of unbiased noise, ensured by twirling if necessary. The security analysis reveals an asymmetry in Eve's conditioned ancillas for Alice and Bob resulting from their inequivalent roles in the key generation. Upon simplifying the analysis by a plausible symmetry assumption, we find that a secret key can be generated if the noise is below the threshold set by $ε= 0.197$.

quant-ph↗

Optimal Lewenstein-Sanpera decomposition of two-qubit states using Semidefinite Programming

We use the language of semidefinite programming and duality to derive necessary and sufficient conditions for the optimal Lewenstein-Sanpera Decomposition (LSD) of 2-qubit states. We first provide a simple and natural derivation of the Wellens-Kus equations for full-rank states. Then, we obtain a set of necessary and sufficient conditions for the optimal decomposition of rank-3 states. This closes the gap between the full-rank case, where optimality conditions are given by the Wellens-Kus equations, and the rank-2 case, where the optimal decomposition is analytically known. We also give an analytic expression for the optimal LSD of a special class of rank-3 states. Finally, our formulation ensures efficient numerical procedures to return the optimal LSD for any arbitrary 2-qubit state.

quant-ph↗

Average transmission probability of a random stack

The transmission through a stack of identical slabs that are separated by gaps with random widths is usually treated by calculating the average of the logarithm of the transmission probability. We show how to calculate the average of the transmission probability itself with the aid of a recurrence relation and derive analytical upper and lower bounds. The upper bound, when used as an approximation for the transmission probability, is unreasonably good and we conjecture that it is asymptotically exact.

quant-ph↗