Pages that link to "Item:Q4903123"

The following pages link to Realizable Hamiltonians for universal adiabatic quantum computers (Q4903123):

Displaying 16 items.

• An adiabatic quantum algorithm and its application to DNA motif model discovery (Q527201) (← links)
• Resonant transition-based quantum computation (Q1679261) (← links)
• Constant-round blind classical verification of quantum sampling (Q2170108) (← links)
• Ising formulations of some graph-theoretic problems in psychological research: models and methods (Q2244634) (← links)
• Theory versus practice in annealing-based quantum computing (Q2306020) (← links)
• Verification of quantum computation: an overview of existing approaches (Q2311888) (← links)
• Quantum adiabatic machine learning (Q2393692) (← links)
• Generalized quantum partial adiabatic evolution (Q2454244) (← links)
• Universal computation with quantum fields (Q2681706) (← links)
• Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions (Q2684240) (← links)
• Complexity Classification of Local Hamiltonian Problems (Q2799351) (← links)
• Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians (Q3387762) (← links)
• Classical Verification of Quantum Computations (Q5096105) (← links)
• Infrared-dressed entanglement of cold open-shell polar molecules for universal matchgate quantum computing (Q5143465) (← links)
• Fast universal quantum computation with railroad-switch local Hamiltonians (Q5251258) (← links)
• Realizing number recognition with simulated quantum semi-restricted Boltzmann machine (Q6043733) (← links)