Sub-quadratic Decoding of One-point Hermitian Codes

We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes. The first is based on a fast realisation of the Guruswami-Sudan algorithm by using state-of-the-art algorithms from computer algebra for polynomial-ring matrix minimisation. The second is a Power decoding algorithm: an extension of classical key equation decoding which gives a probabilistic decoding algorithm up to the Sudan radius. We show how the resulting key equations can be solved by the same methods from computer algebra, yielding similar asymptotic complexities.Comment: New version includes simulation results, improves some complexity results, as well as a number of reviewer corrections. 20 page

McStas and Mantid integration

McStas and Mantid are two well established software frameworks within the neutron scattering community. McStas has been primarily used for simulating the neutron transport of instruments, while Mantid has been primarily used for data reduction. We report here the status of our work done on the interoperability between the instrument simulation software McStas and the data reduction software Mantid. This provides a demonstration of how to successfully link together two software that otherwise have been developed independently, and in particular here show how this has been achieved for an instrument simulation software and a data reduction software. This paper will also provide examples of some of the expected future enhanced analysis that can be achieved from combining accurate instrument and sample simulations with software for correcting raw data. In the case of this work for raw data collected at large scale neutron facilities.Comment: 17 pages, 12 figures, POSTPRINT with proofs of article submitted to Journal of Neutron Researc

Geometric quantum gate for trapped ions based on optical dipole forces induced by Gaussian laser beams

We present an implementation of quantum logic gates via internal state dependent displacements of ions in a linear Paul trap caused by optical dipole forces. Based on a general quantum analysis of the system dynamics we consider specific implementations with alkaline earth ions. For experimentally realistic parameters gate infidelities as low as $10^{-4}$ can be obtained.Comment: 10 pages, 4 figure

Theory of Spin Relaxation in Two-Electron Lateral Coupled Si/SiGe Quantum Dots

Highly accurate numerical results of phonon-induced two-electron spin relaxation in silicon double quantum dots are presented. The relaxation, enabled by spin-orbit coupling and the nuclei of $^{29}$Si (natural or purified abundance), are investigated for experimentally relevant parameters, the interdot coupling, the magnetic field magnitude and orientation, and the detuning. We calculate relaxation rates for zero and finite temperatures (100 mK), concluding that our findings for zero temperature remain qualitatively valid also for 100 mK. We confirm the same anisotropic switch of the axis of prolonged spin lifetime with varying detuning as recently predicted in GaAs. Conditions for possibly hyperfine-dominated relaxation are much more stringent in Si than in GaAs. For experimentally relevant regimes, the spin-orbit coupling, although weak, is the dominant contribution, yielding anisotropic relaxation rates of at least two order of magnitude lower than in GaAs.Comment: 11 pages, 10 figure

The Bravyi-Kitaev transformation for quantum computation of electronic structure

Quantum simulation is an important application of future quantum computers with applications in quantum chemistry, condensed matter, and beyond. Quantum simulation of fermionic systems presents a specific challenge. The Jordan-Wigner transformation allows for representation of a fermionic operator by O(n) qubit operations. Here we develop an alternative method of simulating fermions with qubits, first proposed by Bravyi and Kitaev [S. B. Bravyi, A.Yu. Kitaev, Annals of Physics 298, 210-226 (2002)], that reduces the simulation cost to O(log n) qubit operations for one fermionic operation. We apply this new Bravyi-Kitaev transformation to the task of simulating quantum chemical Hamiltonians, and give a detailed example for the simplest possible case of molecular hydrogen in a minimal basis. We show that the quantum circuit for simulating a single Trotter time-step of the Bravyi-Kitaev derived Hamiltonian for H2 requires fewer gate applications than the equivalent circuit derived from the Jordan-Wigner transformation. Since the scaling of the Bravyi-Kitaev method is asymptotically better than the Jordan-Wigner method, this result for molecular hydrogen in a minimal basis demonstrates the superior efficiency of the Bravyi-Kitaev method for all quantum computations of electronic structure

Improved Pregnancy Outcome in Type 1 Diabetic Women With Microalbuminuria or Diabetic Nephropathy: Effect of intensified antihypertensive therapy?

OBJECTIVE—To describe pregnancy outcome in type 1 diabetic women with normoalbuminuria, microalbuminuria, or diabetic nephropathy after implementation of an intensified antihypertensive therapeutic strategy

Photonic qubits, qutrits and ququads accurately prepared and delivered on demand

Reliable encoding of information in quantum systems is crucial to all approaches to quantum information processing or communication. This applies in particular to photons used in linear optics quantum computing (LOQC), which is scalable provided a deterministic single-photon emission and preparation is available. Here, we show that narrowband photons deterministically emitted from an atom-cavity system fulfill these requirements. Within their 500 ns coherence time, we demonstrate a subdivision into d time bins of various amplitudes and phases, which we use for encoding arbitrary qu-d-its. The latter is done deterministically with a fidelity >95% for qubits, verified using a newly developed time-resolved quantum-homodyne method.Comment: 5 pages, 4 figure

Minimal instances for toric code ground states

A decade ago Kitaev's toric code model established the new paradigm of topological quantum computation. Due to remarkable theoretical and experimental progress, the quantum simulation of such complex many-body systems is now within the realms of possibility. Here we consider the question, to which extent the ground states of small toric code systems differ from LU-equivalent graph states. We argue that simplistic (though experimentally attractive) setups obliterate the differences between the toric code and equivalent graph states; hence we search for the smallest setups on the square- and triangular lattice, such that the quasi-locality of the toric code hamiltonian becomes a distinctive feature. To this end, a purely geometric procedure to transform a given toric code setup into an LC-equivalent graph state is derived. In combination with an algorithmic computation of LC-equivalent graph states, we find the smallest non-trivial setup on the square lattice to contain 5 plaquettes and 16 qubits; on the triangular lattice the number of plaquettes and qubits is reduced to 4 and 9, respectively.Comment: 14 pages, 11 figure

Supertubes versus superconducting tubes

In this paper we show the relationship between cylindrical D2-branes and cylindrical superconducting membranes described by a generic effective action at the bosonic level. In the first case the extended objects considered, arose as blown up type IIA superstrings to D2-branes, named supertubes. In the second one, the cosmological objects arose from some sort of field theories. The Dirac-Born-Infeld action describing supertubes is shown to be equivalent to the generic effective action describing superconducting membranes via a special transformation.Comment: Version with minor text changes with respect to the already publishe