Pages that link to "Item:Q2099650"
From MaRDI portal
The following pages link to Empirical performance bounds for quantum approximate optimization (Q2099650):
Displaying 11 items.
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems (Q669949) (← links)
- Efficient depth selection for the implementation of noisy quantum approximate optimization algorithm (Q2109217) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Benchmarking the quantum approximate optimization algorithm (Q2681529) (← links)
- On the universality of the quantum approximate optimization algorithm (Q2681661) (← links)
- Impact of graph structures for QAOA on maxcut (Q2685581) (← links)
- Quantum k-community detection: algorithm proposals and cross-architectural evaluation (Q2685603) (← links)
- Lower bounds on circuit depth of the quantum approximate optimization algorithm (Q2687096) (← links)
- Improving the performance of quantum approximate optimization for preparing non-trivial quantum states without translational symmetry (Q6042395) (← links)
- An introduction to variational quantum algorithms for combinatorial optimization problems (Q6054009) (← links)
- A review on quantum approximate optimization algorithm and its variants (Q6546559) (← links)