Pages that link to "Item:Q2878633"
From MaRDI portal
The following pages link to A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems (Q2878633):
Displaying 14 items.
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
- Graph isomorphism and Gaussian boson sampling (Q825567) (← links)
- Solving problem of graph isomorphism by membrane-quantum hybrid model (Q1650334) (← links)
- QUBO formulations for the graph isomorphism problem and related problems (Q1682856) (← links)
- Constructing quantum hash functions based on quantum walks on Johnson graphs (Q1993776) (← links)
- Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation (Q2239653) (← links)
- Hash function based on quantum walks (Q2322065) (← links)
- Treating the independent set problem by 2D Ising interactions with adiabatic quantum computing (Q2573088) (← links)
- Quantum walk and its application domains: a systematic review (Q2668386) (← links)
- Quantum walk inspired algorithm for graph similarity and isomorphism (Q2681642) (← links)
- Novel two-party quantum private comparison via quantum walks on circle (Q2690250) (← links)
- On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism (Q3068637) (← links)
- Quantum state transfer on unsymmetrical graphs via discrete-time quantum walk (Q5210408) (← links)
- On the circuit model of two quantum adiabatic search algorithms (Q6634671) (← links)