Pages that link to "Item:Q3101369"
From MaRDI portal
The following pages link to A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem (Q3101369):
Displayed 41 items.
- Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator (Q5073179) (← links)
- Template-Based Minor Embedding for Adiabatic Quantum Optimization (Q5084660) (← links)
- FORECASTING STOCK MARKET CRASHES VIA REAL-TIME RECESSION PROBABILITIES: A QUANTUM COMPUTING APPROACH (Q5101557) (← links)
- Collective dynamics of phase-repulsive oscillators solves graph coloring problem (Q5112986) (← links)
- Elimination of perturbative crossings in adiabatic quantum optimization (Q5135874) (← links)
- Fidelity-optimized quantum state estimation (Q5136088) (← links)
- Universal quantum computation by scattering in the Fermi–Hubbard model (Q5136105) (← links)
- Quantum adiabatic Markovian master equations (Q5137805) (← links)
- Operational geometric phase for mixed quantum states (Q5141481) (← links)
- Error suppression and error correction in adiabatic quantum computation: non-equilibrium dynamics (Q5141615) (← links)
- Efficient quantum circuits for diagonal unitaries without ancillas (Q5143192) (← links)
- Transitionless quantum driving in open quantum systems (Q5143211) (← links)
- Why the quantitative condition fails to reveal quantum adiabaticity (Q5143212) (← links)
- Exploring adiabatic quantum trajectories via optimal control (Q5143256) (← links)
- A class of time-energy uncertainty relations for time-dependent Hamiltonians (Q5160696) (← links)
- Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes (Q5161684) (← links)
- The fundamental gap for a class of Schrödinger operators on path and hypercube graphs (Q5171356) (← 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)
- Topological Quantum Computation (Q5300887) (← links)
- ON THE GAP OF HAMILTONIANS FOR THE ADIABATIC SIMULATION OF QUANTUM CIRCUITS (Q5417139) (← links)
- Why should anyone care about computing with anyons? (Q5438173) (← links)
- Quantum Random Walks – New Method for Designing Quantum Algorithms (Q5448636) (← links)
- Decoherence rates in large-scale quantum computers and macroscopic quantum systems (Q5719243) (← links)
- The theory of variational hybrid quantum-classical algorithms (Q5854958) (← links)
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems (Q5855059) (← links)
- Iterative classical superadiabatic algorithm for combinatorial optimization (Q5869986) (← links)
- Convergence condition of simulated quantum annealing with a non-stoquastic catalyst (Q5885295) (← links)
- (Q5889076) (← links)
- How does adiabatic quantum computation fit into quantum automata theory? (Q5918616) (← links)
- Analytic approach to the Landau–Zener problem in bounded parameter space (Q6045374) (← links)
- Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers (Q6048724) (← links)
- Why adiabatic quantum annealing is unlikely to yield speed-up (Q6059153) (← links)
- Graph minors from simulated annealing for annealing machines with sparse connectivity (Q6073022) (← links)
- Reliability of Digitized Quantum Annealing and the Decay of Entanglement (Q6080011) (← links)
- Statistical Analysis of Quantum Annealing (Q6092954) (← links)
- Solving the Kemeny ranking aggregation problem with quantum optimization algorithms (Q6139170) (← links)
- Dissipation in adiabatic quantum computers: lessons from an exactly solvable model (Q6173629) (← links)
- The set partitioning problem in a quantum context (Q6181360) (← links)
- On renormalization and the local gap method for proving frustration-free local spin chains are gapped (Q6183543) (← links)