491 research outputs found

    Entanglement Generation of Nearly-Random Operators

    Full text link
    We study the entanglement generation of operators whose statistical properties approach those of random matrices but are restricted in some way. These include interpolating ensemble matrices, where the interval of the independent random parameters are restricted, pseudo-random operators, where there are far fewer random parameters than required for random matrices, and quantum chaotic evolution. Restricting randomness in different ways allows us to probe connections between entanglement and randomness. We comment on which properties affect entanglement generation and discuss ways of efficiently producing random states on a quantum computer.Comment: 5 pages, 3 figures, partially supersedes quant-ph/040505

    A new view on relativity: Part 2. Relativistic dynamics

    Get PDF
    The Lorentz transformations are represented on the ball of relativistically admissible velocities by Einstein velocity addition and rotations. This representation is by projective maps. The relativistic dynamic equation can be derived by introducing a new principle which is analogous to the Einstein's Equivalence Principle, but can be applied for any force. By this principle, the relativistic dynamic equation is defined by an element of the Lie algebra of the above representation. If we introduce a new dynamic variable, called symmetric velocity, the above representation becomes a representation by conformal, instead of projective maps. In this variable, the relativistic dynamic equation for systems with an invariant plane, becomes a non-linear analytic equation in one complex variable. We obtain explicit solutions for the motion of a charge in uniform, mutually perpendicular electric and magnetic fields. By the above principle, we show that the relativistic dynamic equation for the four-velocity leads to an analog of the electromagnetic tensor. This indicates that force in special relativity is described by a differential two-form

    Quantum Pseudorandomness from Cluster-State Quantum Computation

    Get PDF
    We show how to efficiently generate pseudorandom states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudorandom algorithms in the cluster-state picture, we identify a strategy for optimizing pseudorandom circuits by properly choosing single-qubit rotations. A Markov chain analysis provides the tool for analyzing convergence rates to the Haar measure and finding the optimal single-qubit gate distribution. Our results may be viewed as an alternative construction of approximate unitary 2-designs

    Parameters of Pseudorandom Quantum Circuits

    Get PDF
    Pseudorandom circuits generate quantum states and unitary operators which are approximately distributed according to the unitarily invariant Haar measure. We explore how several design parameters affect the efficiency of pseudorandom circuits, with the goal of identifying relevant tradeoffs and optimizing convergence. The parameters we explore include the choice of single- and two-qubit gates, the topology of the underlying physical qubit architecture, the probabilistic application of two-qubit gates, as well as circuit size, initialization, and the effect of control constraints. Building on the equivalence between pseudorandom circuits and approximate t-designs, a Markov matrix approach is employed to analyze asymptotic convergence properties of pseudorandom second-order moments to a 2-design. Quantitative results on the convergence rate as a function of the circuit size are presented for qubit topologies with a sufficient degree of symmetry. Our results may be useful towards optimizing the efficiency of random state and operator generation

    Simultaneous target state and passive sensors bias estimation

    Get PDF
    Most of the literature pertaining to target tracking assumes that the sensor data are corrupted by measurement noises that are zero mean (i.e., unbiased) and with known variances (accuracies). However in real tracking systems, measurements from sensors exhibit, typically, biases. For angle-only sensors, imperfect registration leads to Line Of Sight (LOS) measurement biases in azimuth and elevation. In this project we propose a new methodology that uses an exoatmospheric target of opportunity seen in a satellites borne sensor\u27s field of view to estimate the sensor\u27s biases simultaneously with the state of the target. The first step is to formulate a general bias model for synchronized optical sensors; then we use a Maximum Likelihood (ML) approach that leads to a nonlinear least-squares estimation problem for simultaneous estimation of the 3D Cartesian position and velocity components of the target of opportunity and the angle measurement biases of the sensors (two in the present study). Each satellite is equipped with an IR sensor that provides LOS measurements (azimuth and elevation) to the target. The measurements provided by these sensors are assumed to be noisy and biased but perfectly associated, i.e., it is known perfectly that they belong to the same target. The sensor bias and the target state estimates, obtained via Iterative Least Squares (ILS), are shown, by the simulation, to be unbiased

    Matrix Element Distribution as a Signature of Entanglement Generation

    Full text link
    We explore connections between an operator's matrix element distribution and its entanglement generation. Operators with matrix element distributions similar to those of random matrices generate states of high multi-partite entanglement. This occurs even when other statistical properties of the operators do not conincide with random matrices. Similarly, operators with some statistical properties of random matrices may not exhibit random matrix element distributions and will not produce states with high levels of multi-partite entanglement. Finally, we show that operators with similar matrix element distributions generate similar amounts of entanglement.Comment: 7 pages, 6 figures, to be published PRA, partially supersedes quant-ph/0405053, expands quant-ph/050211

    A self-assembling amphiphilic peptide nanoparticle for the efficient entrapment of DNA cargoes up to 100 nucleotides in length

    Get PDF
    To overcome the low efficiency and cytotoxicity associated with most non-viral DNA delivery systems we developed a purely peptidic self-assembling system that is able to entrap single- and doublestranded DNA of up to 100 nucleotides in length. (HR)3gT peptide design consists of a hydrophilic domain prone to undergo electrostatic interactions with DNA cargo, and a hydrophobic domain at a ratio that promotes the self-assembly into multi-compartment micellar nanoparticles (MCM-NPs). Selfassembled (HR)3gT MCM-NPs range between 100 to 180 nm which is conducive to a rapid and efficient uptake by cells. (HR)3gT MCM-NPs had no adverse effects on HeLa cell viability. In addition, they exhibit long-term structural stability at 4 1C but at 371C, the multi-micellar organization disassembles overtime which demonstrates their thermo-responsiveness. The comparison of (HR)3gT to a shorter, less charged H3gT peptide indicates that the additional arginine residues result in the incorporation of longer DNA segments, an improved DNA entrapment efficiency and an increase cellular uptake. Our unique nonviral system for DNA delivery sets the stage for developing amphiphilic peptide nanoparticles as candidates for future systemic gene delivery
    corecore