A bounded-error quantum polynomial-time algorithm for two graph bisection problems
From MaRDI portal
Publication:747789
DOI10.1007/s11128-015-1069-yzbMath1325.81058arXiv1505.06284OpenAlexW3121505928WikidataQ62040672 ScholiaQ62040672MaRDI QIDQ747789
Publication date: 19 October 2015
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.06284
Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12) Graph designs and isomorphic decomposition (05C51)
Related Items (2)
Reading a single qubit system using weak measurement with variable strength ⋮ Quantum algorithm for quantum state discrimination via partial negation and weak measurement
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact combinatorial algorithm for minimum graph bisection
- A framework for solving VLSI graph layout problems
- MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
- Enhanced quantum searching via entanglement and partial diffusion
- Some simplified NP-complete graph problems
- Min-cut clustering
- An exact algorithm for graph partitioning
- Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems
- An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
- An Automatic Method of Solving Discrete Programming Problems
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- Applications of a Planar Separator Theorem
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Distributed Evolutionary Graph Partitioning
- The RPR2 rounding technique for semidefinite programs
- Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
- Algorithms and Computation
This page was built for publication: A bounded-error quantum polynomial-time algorithm for two graph bisection problems
