Pages that link to "Item:Q3548553"
From MaRDI portal
The following pages link to Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation (Q3548553):
Displaying 43 items.
- Quantum Computing Meets the Real World (Q2945557) (← links)
- On quantum lambda calculi: a foundational perspective (Q2973238) (← links)
- (Q3002763) (← links)
- An introduction to quantum annealing (Q3006161) (← links)
- Anderson localization makes adiabatic quantum optimization fail (Q3073990) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- <i>Colloquium</i>: Quantum annealing and analog quantum computation (Q3077047) (← links)
- The Kitaev–Feynman clock for open quantum systems (Q3387145) (← links)
- On the power of coherently controlled quantum adiabatic evolutions (Q3387465) (← links)
- Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians (Q3387762) (← links)
- ENTANGLEMENT PROPERTIES OF ADIABATIC QUANTUM ALGORITHMS (Q3405965) (← links)
- Exponential vanishing of the ground-state gap of the quantum random energy model via adiabatic quantum computing (Q3457167) (← links)
- A Modified Adiabatic Quantum Algorithm for Evaluation of Boolean Functions (Q3459352) (← links)
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation (Q3548553) (← links)
- Adiabatic quantum state generation and statistical zero knowledge (Q3581286) (← links)
- Adiabatic approximation with exponential accuracy for many-body systems and quantum computation (Q3583606) (← links)
- On a measurement-free quantum lambda calculus with classical control (Q3625676) (← links)
- Quantum machine learning: a classical perspective (Q4556858) (← links)
- QUBO formulation for the contact map overlap problem (Q4620297) (← links)
- How to make assisted driving Hamiltonian useful in quantum adiabatic computation? (Q4633642) (← links)
- Realizable Hamiltonians for universal adiabatic quantum computers (Q4903123) (← links)
- ON THE ADIABATIC EVOLUTION OF ONE-DIMENSIONAL PROJECTOR HAMILTONIANS (Q4904809) (← links)
- Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer (Q4972864) (← links)
- (Q5002773) (← links)
- (Q5020598) (← links)
- (Q5090371) (← links)
- An Introduction to Quantum Computing, without the Physics (Q5140614) (← links)
- Symmetry-protected adiabatic quantum transistors (Q5144009) (← links)
- Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes (Q5161684) (← links)
- Automatically Translating Quantum Programs from a Subset of Common Gates to an Adiabatic Representation (Q5237220) (← links)
- Generation of elementary gates and Bell’s states using controlled adiabatic evolutions (Q5242237) (← links)
- Fast universal quantum computation with railroad-switch local Hamiltonians (Q5251258) (← links)
- On the General Class of Models of Adiabatic Evolution (Q5298330) (← links)
- ON THE GAP OF HAMILTONIANS FOR THE ADIABATIC SIMULATION OF QUANTUM CIRCUITS (Q5417139) (← links)
- (Q5454247) (redirect page) (← links)
- The theory of variational hybrid quantum-classical algorithms (Q5854958) (← links)
- How does adiabatic quantum computation fit into quantum automata theory? (Q5918616) (← links)
- A practitioner’s guide to quantum algorithms for optimisation problems (Q6063352) (← links)
- Symmetry‐Protected Quantum Adiabatic Evolution in Spontaneous Symmetry‐Breaking Transitions (Q6085933) (← links)
- Statistical Analysis of Quantum Annealing (Q6092954) (← links)
- Application of quantum approximate optimization algorithm to job shop scheduling problem (Q6113354) (← links)
- Evaluating the convergence of tabu enhanced hybrid quantum optimization (Q6159265) (← links)
- Topological quantum gates in homotopy type theory (Q6584358) (← links)