Universality of entanglement and quantum-computation complexity (original) (raw)
Related papers
Adiabatic quantum computation and quantum phase transitions
Physical Review A, 2004
COMPLEXITY CONSIDERATIONS QUANTUM COMPUTATION
World Scintific, 2013
Algorithmic Complexity and Entanglement of Quantum States
Physical Review Letters, 2005
Simulation of quantum algorithms for classification of their complexity
Simulation of quantum algorithms for classification of their complexity, 2015
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
SIAM Journal on Computing, 2007
Preface to the Special Issue on “Quantum Computing Algorithms and Computational Complexity”
Mathematics
Complexity considerations on quantum computation
Entanglement and adiabatic quantum computation
Canadian Journal of Physics, 2006
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Science, 2001
Computing Research Repository, 2010
Quantum adiabatic computation and the travelling salesman problem
Arxiv preprint quant-ph/0601151, 2006
Quantum adiabatic algorithm for factorization and its experimental implementation
Physical Review A, 2005
Generation of entanglement in finite spin systems via adiabatic quantum computation
The European Physical Journal D, 2010
Quantum annealing: The fastest route to quantum computation?
The European Physical Journal Special Topics, 2015
Quantum Algorithms Topics in Complexity-Theory
2011
Role of entanglement in quantum computation
2012
Majorization in quantum adiabatic algorithms
Physical Review A, 2006
First-order quantum phase transition in adiabatic quantum computation
Physical Review A, 2009
Detailed Account of Complexity for Implementation of Quantum Algorithms
arXiv (Cornell University), 2021
Speed-up and Quantum Advantages in Quantum Algorithms
From quantum circuits to adiabatic algorithms
Physical Review A, 2005
The complexity of quantum spin systems on a two-dimensional square lattice
2005
A Factorisation Algorithm in Adiabatic Quantum Computation
Journal of Physics Communications, 2019
AN ANATOMY OF A QUANTUM ADIABATIC ALGORITHM THAT TRANSCENDS THE TURING COMPUTABILITY
International Journal of Quantum Information, 2005
Classical complexity and quantum entanglement
Journal of Computer and System Sciences, 2004
Quantum Algorithms and Hard Problems
2006
On Non Efficiency of Quantum Computer
2000
Entanglement complexity in quantum many-body dynamics, thermalization, and localization
Physical Review B, 2017
Adiabatic quantum computation: Enthusiast and Sceptic's perspectives
Classical simulability, entanglement breaking, and quantum computation thresholds
Physical Review A, 2005
Eprint Arxiv Quant Ph 0210077, 2002
Finite temperature quantum algorithm and majorization
2008