Astroglial Plasticity Is Implicated in Hippocampal Remodelling in Adult Rats Exposed to Antenatal Dexamethasone

The long-term effects of antenatal dexamethasone treatment on brain remodelling in 3-months old male Sprague-Dawley rats whose mothers had been treated with dexamethasone were investigated in the present study. Dorsal hippocampus, basolateral amygdala and nucleus accumbens volume, cell numbers and GFAP-immunoreactive astroglial cell morphology were analysed using stereology. Total brain volume as assessed by microCT was not affected by the treatment. The relative volume of the dorsal hippocampus (% of total brain volume) showed a moderate, by 8%, but significant reduction in dexamethasone-treated vs control animals. Dexamethasone had no effect on the total and GFAP-positive cell numbers in the hippocampal sub-regions, basolateral amygdala and nucleus accumbens. Morphological analysis indicated that numbers of astroglial primary processes were not affected in any of the hippocampal sub-regions analysed but significant reductions in the total primary process length were observed in CA1 by 32%, CA3 by 50% and DG by 25%. Mean primary process length values were also significantly decreased in CA1 by 25%, CA3 by 45% and DG by 25%. No significant astroglial morphological changes were found in basolateral amygdala and nucleus accumbens. We propose that the dexamethasone-dependent impoverishment of hippocampal astroglial morphology is the case of maladaptive glial plasticity induced prenatally

Synthesis of Quantum Logic Circuits

We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the state-space of an n-qubit register is not finite and contains exponential superpositions of classical bit strings. Our proposed circuits are asymptotically optimal for respective tasks and improve published results by at least a factor of two. The circuits for generic quantum computation constructed by our algorithms are the most efficient known today in terms of the number of expensive gates (quantum controlled-NOTs). They are based on an analogue of the Shannon decomposition of Boolean functions and a new circuit block, quantum multiplexor, that generalizes several known constructions. A theoretical lower bound implies that our circuits cannot be improved by more than a factor of two. We additionally show how to accommodate the severe architectural limitation of using only nearest-neighbor gates that is representative of current implementation technologies. This increases the number of gates by almost an order of magnitude, but preserves the asymptotic optimality of gate counts.Comment: 18 pages; v5 fixes minor bugs; v4 is a complete rewrite of v3, with 6x more content, a theory of quantum multiplexors and Quantum Shannon Decomposition. A key result on generic circuit synthesis has been improved to ~23/48*4^n CNOTs for n qubit

Speed limits for quantum gates in multi-qubit systems

We use analytical and numerical calculations to obtain speed limits for various unitary quantum operations in multiqubit systems under typical experimental conditions. The operations that we consider include single-, two-, and three-qubit gates, as well as quantum-state transfer in a chain of qubits. We find in particular that simple methods for implementing two-qubit gates generally provide the fastest possible implementations of these gates. We also find that the three-qubit Toffoli gate time varies greatly depending on the type of interactions and the system's geometry, taking only slightly longer than a two-qubit controlled-NOT (CNOT) gate for a triangle geometry. The speed limit for quantum-state transfer across a qubit chain is set by the maximum spin-wave speed in the chain.Comment: 7 pages (two-column), 2 figures, 2 table

Efficient quantum algorithm for preparing molecular-system-like states on a quantum computer

We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin orbitals. Each spin orbital is mapped to a qubit: the states $| 1 >$ and $| 0>$ of the qubit represent, respectively, whether the spin orbital is occupied by an electron or not. To prepare a general state in the full Hilbert space of $n$ qubits, which is of dimension $2^{n}$%, $O(2^{n})$ controlled-NOT gates are needed, i.e., the number of gates scales \emph{exponentially} with the number of qubits. We make use of the fact that the state to be prepared lies in a smaller Hilbert space, and we find an algorithm that requires at most $O(2^{m+1} n^{m}/{m!})$ gates, i.e., scales \emph{polynomially} with the number of qubits $n$, provided $n\gg m$. The algorithm is simulated numerically for the cases of the hydrogen molecule and the water molecule. The numerical simulations show that when additional symmetries of the system are considered, the number of gates to prepare the state can be drastically reduced, in the examples considered in this paper, by several orders of magnitude, from the above estimate.Comment: 11 pages, 8 figures, errors are corrected, Journal information adde

Minimal Universal Two-qubit Quantum Circuits

We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare favorably to previously published results. Temporary storage is not used because it tends to be expensive in physical implementations. For each gate library, best gate counts can be achieved by a single universal circuit. To compute gate parameters in universal circuits, we only use closed-form algebraic expressions, and in particular do not rely on matrix exponentials. Our algorithm has been coded in C++.Comment: 8 pages, 2 tables and 4 figures. v3 adds a discussion of asymetry between Rx, Ry and Rz gates and describes a subtle circuit design problem arising when Ry gates are not available. v2 sharpens one of the loose bounds in v1. Proof techniques in v2 are noticeably revamped: they now rely less on circuit identities and more on directly-computed invariants of two-qubit operators. This makes proofs more constructive and easier to interpret as algorithm

Quantum algorithm for simulating the dynamics of an open quantum system

In the study of open quantum systems, one typically obtains the decoherence dynamics by solving a master equation. The master equation is derived using knowledge of some basic properties of the system, the environment and their interaction: one basically needs to know the operators through which the system couples to the environment and the spectral density of the environment. For a large system, it could become prohibitively difficult to even write down the appropriate master equation, let alone solve it on a classical computer. In this paper, we present a quantum algorithm for simulating the dynamics of an open quantum system. On a quantum computer, the environment can be simulated using ancilla qubits with properly chosen single-qubit frequencies and with properly designed coupling to the system qubits. The parameters used in the simulation are easily derived from the parameters of the system+environment Hamiltonian. The algorithm is designed to simulate Markovian dynamics, but it can also be used to simulate non-Markovian dynamics provided that this dynamics can be obtained by embedding the system of interest into a larger system that obeys Markovian dynamics. We estimate the resource requirements for the algorithm. In particular, we show that for sufficiently slow decoherence a single ancilla qubit could be sufficient to represent the entire environment, in principle.Comment: 5 figures, two table

An Arbitrary Two-qubit Computation In 23 Elementary Gates

Quantum circuits currently constitute a dominant model for quantum computation. Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and as small a number of elementary quantum gates as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2 CNOTs. To this end, we constructively prove a worst-case upper bound of 23 elementary gates, of which at most 4 (CNOT) entail multi-qubit interactions. Our analysis shows that synthesis algorithms suggested in previous work, although more general, entail much larger quantum circuits than ours in the special case of two qubits. One such algorithm has a worst case of 61 gates of which 18 may be CNOTs. Our techniques rely on the KAK decomposition from Lie theory as well as the polar and spectral (symmetric Shur) matrix decompositions from numerical analysis and operator theory. They are related to the canonical decomposition of a two-qubit gate with respect to the ``magic basis'' of phase-shifted Bell states, published previously. We further extend this decomposition in terms of elementary gates for quantum computation.Comment: 18 pages, 7 figures. Version 2 gives correct credits for the GQC "quantum compiler". Version 3 adds justification for our choice of elementary gates and adds a comparison with classical library-less logic synthesis. It adds acknowledgements and a new reference, adds full details about the 8-gate decomposition of topC-V and stealthily fixes several minor inaccuracies. NOTE: Using a new technique, we recently improved the lower bound to 18 gates and (tada!) found a circuit decomposition that requires 18 gates or less. This work will appear as a separate manuscrip

Synthesis and Optimization of Reversible Circuits - A Survey

Reversible logic circuits have been historically motivated by theoretical research in low-power electronics as well as practical improvement of bit-manipulation transforms in cryptography and computer graphics. Recently, reversible circuits have attracted interest as components of quantum algorithms, as well as in photonic and nano-computing technologies where some switching devices offer no signal gain. Research in generating reversible logic distinguishes between circuit synthesis, post-synthesis optimization, and technology mapping. In this survey, we review algorithmic paradigms --- search-based, cycle-based, transformation-based, and BDD-based --- as well as specific algorithms for reversible synthesis, both exact and heuristic. We conclude the survey by outlining key open challenges in synthesis of reversible and quantum logic, as well as most common misconceptions.Comment: 34 pages, 15 figures, 2 table

Measurements of scattering observables for the pdpd break-up reaction

High-precision measurements of the scattering observables such as cross sections and analyzing powers for the proton-deuteron elastic and break-up reactions have been performed at KVI in the last two decades and elsewhere to investigate various aspects of the three-nucleon force (3NF) effects simultaneously. In 2006 an experiment was performed to study these effects in $\vec{p}+d$ break-up reaction at 135 MeV with the detection system, Big Instrument for Nuclear polarization Analysis, BINA. BINA covers almost the entire kinematical phase space of the break-up reaction. The results are interpreted with the help of state-of-the-art Faddeev calculations and are partly presented in this contribution.Comment: Proceedings of 19th International IUPAP Conference on Few-Body Problems in Physics, Bonn University, 31.08 - 05.09.2009, Bonn, GERMAN