Pages that link to "Item:Q3548553"

The following pages link to Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation (Q3548553):

Displaying 50 items.

• Challenges of adiabatic quantum evaluation of NAND trees (Q264902) (← links)
• The improved evolution paths to speedup quantum evolution (Q292960) (← links)
• On the role of prior probability in adiabatic quantum algorithms (Q293874) (← links)
• Adiabatic quantum optimization with qudits (Q353004) (← links)
• SQR: a simple quantum representation of infrared images (Q479392) (← links)
• Optimality of partial adiabatic search and its circuit model (Q488158) (← links)
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design (Q544830) (← links)
• Adiabatic times for Markov chains and applications (Q634167) (← links)
• Lie algebras for some specific dissipative Landau-Zener problems (Q736403) (← links)
• Adiabatic Landau-Zener transitions at avoided level crossings with fast noise (Q738270) (← links)
• On the circuit model of global adiabatic search algorithm (Q747137) (← links)
• Error-run-time trade-off in the adiabatic approximation beyond scaling relations (Q778493) (← links)
• The power of quantum systems on a line (Q842451) (← links)
• Computational complexity of the landscape. I. (Q877685) (← links)
• Quantum interference computation (Q943981) (← links)
• Adiabatic quantum counting by geometric phase estimation (Q989904) (← links)
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem (Q1007120) (← links)
• Quantum algorithm design: techniques and applications (Q1730317) (← links)
• Quantum pattern recognition with multi-neuron interactions (Q1746862) (← links)
• Quantum walks: a comprehensive review (Q1757875) (← links)
• Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers (Q1790350) (← links)
• Quantum speed-up for unsupervised learning (Q1945031) (← links)
• The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) (Q2018136) (← links)
• Translationally invariant universal quantum Hamiltonians in 1D (Q2068372) (← links)
• Quantum random access stored-program machines (Q2084736) (← links)
• Entangling problem Hamiltonian for adiabatic quantum computation (Q2095868) (← links)
• Quantum path computing: computing architecture with propagation paths in multiple plane diffraction of classical sources of fermion and boson particles (Q2100803) (← links)
• On the quantum adiabatic evolution with the most general system Hamiltonian (Q2105999) (← links)
• FEqa: Finite element computations on quantum annealers (Q2142201) (← links)
• Constant-round blind classical verification of quantum sampling (Q2170108) (← links)
• Efficient diabatic quantum algorithm in number factorization (Q2213314) (← links)
• Quantum science and quantum technology (Q2218021) (← links)
• Solovay-Kitaev approximations of special orthogonal matrices (Q2246526) (← links)
• Analytic methods in quantum computing (Q2255862) (← links)
• Quantum computing with octonions (Q2290694) (← links)
• Theory versus practice in annealing-based quantum computing (Q2306020) (← links)
• Generalized relation between fidelity and quantum adiabatic evolution (Q2355584) (← links)
• Realizations of standard quantum computational circuits by adiabatic evolution (Q2371536) (← links)
• Progress in quantum algorithms (Q2386407) (← links)
• Quantum adiabatic machine learning (Q2393692) (← links)
• Is the addition of an assisted driving Hamiltonian always useful for adiabatic evolution? (Q2412644) (← links)
• An alternate quantum adiabatic evolution for the Deutsch-Jozsa problem (Q2454229) (← links)
• Generalized quantum partial adiabatic evolution (Q2454244) (← links)
• Ergodic quantum computing (Q2573109) (← links)
• Least-squares solutions to polynomial systems of equations with quantum annealing (Q2677531) (← links)
• \texttt{tqix.pis}: a toolbox for quantum dynamics simulation of spin ensembles in Dicke basis (Q2692461) (← links)
• A QUBO formulation for the tree containment problem (Q2699952) (← links)
• Programmable Hamiltonian for One-way Patterns (Q2825371) (← links)
• D-Wave and predecessors: From simulated to quantum annealing (Q2925838) (← links)
• Quantum Computing Meets the Real World (Q2945557) (← links)