• Corpus ID: 117004850

Entanglement, quantum phase transitions and quantum algorithms

  title={Entanglement, quantum phase transitions and quantum algorithms},
  author={Rom{\'a}n {\'O}scar Or{\'u}s Lacort},
  journal={arXiv: Quantum Physics},
Desde las pioneras ideas de Feynman hasta el dia de hoy, la informacion y computacion cuanticas han evolucionado de forma veloz. Siendo la mecanica cuantica en sus origenes considerada esencialmente como un marco teorico en el que poder explicar ciertos procesos fundamentales que acontecian en la Naturaleza, fue durante los anos 80 y 90 cuando se empezo a pensar sobre el comportamiento intrinsecamente cuantico del mundo en el que vivimos como una herramienta con la que poder desarrollar… 
3 Citations
Breakdown of local convertibility through Majorana modes in a quantum quench
Physics Division, National Center for Theoretical Sciences, Hsinchu, 30013, Taiwan(Dated: April 2, 2015)The local convertibility of quantum states, as measured by the R´enyi entropy, is concerned
Beyond the Stalemate: Conscious Mind -Body - Quantum Mechanics - Free Will - Possible Panpsychism - Possible Interpretation of Quantum Enigma
I wish to discuss a large, interwoven set of topics pointed at in the title above. Much of what I say is highly speculative, some is testable, some is, at present, surely not. It is, I hope, useful,


On the role of entanglement in quantum-computational speed-up
  • R. Jozsa, N. Linden
  • Mathematics, Physics
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 2003
For any quantum algorithm operating on pure states, we prove that the presence of multi‐partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the
Quantum Computation
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if
Quantum phase transitions in antiferromagnetic planar cubic lattices
Motivated by its relation to an NP-hard problem, we analyze the ground-state properties of antiferromagnetic Ising-spin networks embedded on planar cubic lattices, under the action of homogeneous
Strengths and Weaknesses of Quantum Computing
It is proved that relative to an oracle chosen uniformly at random with probability 1 the class $\NP$ cannot be solved on a quantum Turing machine (QTM) in time $o(2^{n/2})$.
How powerful is adiabatic quantum computation?
It is argued that the adiabatic approach may be thought of as a kind of 'quantum local search', and a family of minimization problems that is hard for such local search heuristics are designed, and an exponential lower bound is established for the ad iabatic algorithm for these problems.
Entanglement simulations of Shor's algorithm
We demonstrate that, in the case of Shor's algorithm for factoring, highly mixed states will allow efficient quantum computation, indeed factorization can be achieved efficiently with just one
Single-copy entanglement in critical quantum spin chains (5 pages)
We consider the single-copy entanglement as a quantity to assess quantum correlations in the ground state in quantum many-body systems. We show for a large class of models that already on the level
Correlation Functions in Spin Chains and Information Theory
Antiferromagnetic spin chains play an important role in condensed matter physics and statistical mechanics. Recently XXX spin chain was discussed in relation to the information theory. We consider
Multiparty entanglement in graph states
Graph states are multiparticle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions.
Entanglement-area law for general bosonic harmonic lattice systems (14 pages)
We demonstrate that the entropy of entanglement and the distillable entanglement of regions with respect to the rest of a general harmonic-lattice system in the ground or a thermal state scale at