Maximum Clique Problem
A New Algorithm Solves the Maximum Clique Problem with Unprecedented Efficiency in Quantum Leap
A breakthrough in quantum computing has been revealed by researchers Yukun Wang, Wenmin Han, Shiqi Zheng, and Peian Chen. They have developed a new method that significantly improves the efficiency of solving the Maximum Clique Problem (MCP). With the help of an advanced mechanism for dynamically tracking potential clique sizes, this computationally demanding problem which is crucial in many scientific and industrial domains can now be solved with an efficiency gain of n times over current Grover-based approaches.
You can also read ITTI Sets Latin American Distribution For SignQuantum’s PQC
Finding the biggest “complete subgraph” in an undirected graph basically, a set of vertices where each pair of vertices is directly connected by an edge is the goal of the Maximum Clique Problem. The computational complexity of this problem increases exponentially with graph size, rendering classical solutions unfeasible for bigger networks. This problem is categorized as NP-Hard. For example, the worst-case time complexity of classical precise algorithms, which frequently use Branch-and-Bound (B&B) approaches, is, where ‘n’ is the number of vertices.
For large-scale networks, these approaches are impractical due to their rapid complexity increase, and it is very difficult to even obtain decent approximation ratios in polynomial time. Its wide range of uses includes vital fields including data mining, social network analysis, bioinformatics, and communication signal processing. For instance, in social networks, the MCP provides important information on community structures by assisting in determining the largest group of people with whom all members are acquainted.
For some difficult issues, quantum computing has long been seen as a viable solution to the drawbacks of classical techniques. A key component of quantum search, Grover’s technique provides a provable quadratic speedup for a variety of NP-complete tasks. Nevertheless, there were major obstacles in the way of earlier attempts to apply Grover’s technique to MCP. These techniques usually required O(n) measurements and up to O(n√2^n) iterations.
You can also read Nuclear Magnetic Resonance Validate Key Protocol To Quantum
The quantum circuit’s incapacity to dynamically access global information regarding clique sizes during execution was the cause of this inefficiency. Quantum states are unable to reveal intermediate clique sizes without measurement, in contrast to classical algorithms that can modify their search according to a dynamic ‘k’ (vertex count) parameter. This resulted in a significant number of total measurements by forcing earlier + to carry out several iterative full Grover searches, updating ‘k’ only after measurements.
A Dynamic Quantum Solution Emerges
The Pre-Detection and Encoding approach of the new algorithm, which cleverly gets around these restrictions, is the breakthrough. This is accomplished by employing auxiliary qubits to encode previous limits on the vertex count into global variables, thereby dynamically tracking the maximum clique size. The MCP solution can be obtained using just O(√2^n) Grover iterations and O(1) measurements because to this creative method, which successfully removes the necessity for iterative measurements. This is a significant n-fold improvement over the Grover-based techniques currently in use.
Quantum Pre-Detection and Encoding (QPDE), Cliques Detector, MCP Detector, and the Diffusion operation are the four main steps around which the method is carefully organized.
You can also read Quantum Query Complexity: A Key to Quantum Speedups
Quantum Pre-Detection and Encoding (QPDE)
In this first, critical step, the vertex number information of the greatest clique, max_c, is obtained and pre-stored in a quantum register. MCP Prior Constraints Acquisition is incorporated into the QPDE stage to lower computing complexity. This makes use of well-known mathematical ideas like the features of complete graphs and Turán’s theorem. The maximum clique size is then exactly initialized into the quantum register, and the range of potential values is greatly reduced by these theoretical limitations. For example, complete graph properties set an upper bound on the clique size, whereas Turán’s theorem gives a lower restriction depending on the number of vertices and edges. The search space for further quantum computations is successfully shrunk by this exacting constraint acquisition.
Then, Quantum MCP Size Detection uses quantum circuits to find cliques in the refined vertex number range in question. This entails listing all potential vertex sets, counting r-cliques using a simplified quantum counter, and determining whether they form a clique using multi-controlled Toffoli (MCT) gates. A matching qubit in the max_c register is set to |1⟩ in the event that an r-clique is identified. A resulting state in the register for a network with five vertices would show that the maximum clique size is 4.
You can also read Japan KDDI And Partners Launch AI-Quantum Platform
Cliques Detector
The Cliques Detector finds every clique in the graph after initializing the vertex qubits into a uniform superposition state using Hadamard gates. It uses a conjunctive normal form (CNF) to define clique constraints, with each phrase determining whether a pair of vertices and their connected edge meet the clique requirement. The truth values of these clauses are kept in auxiliary registers and are implemented using 3-controlled and X gates. The conjunctive operation is then carried out across all clauses via a multi-controlled X gate, which marks combinations that constitute a clique by flipping a target bit to |1⟩ only when all clause conditions are satisfied.
MCP Detector
The purpose of the MCP Detector is to identify the maximum clique and apply a phase inversion to its corresponding quantum states, which is an essential step for amplitude amplification. It builds on the output from the Cliques Detector and the QPDE. This step includes consistency comparison, sorting, and quantum state duplication. XNOR operations are used to compare the pre-detected max_c information from the QPDE stage with the sorted bit sequence of the putative clique. A Z-gate operation marks the greatest clique by inverting the output qubit’s phase if these sequences are identical.
Diffusion Operator
The Diffusion operator is the last component of a Grover iteration. This component suppresses non-target states while selectively increasing the amplitudes of the marked target states (those with negative phases). The solution is obtained when the system collapses into one of the maximum clique states with high probability after an ideal number of iterations, when the measurement probability of the target states is increased to almost unity.
You can also read QSafe 360 Alliance: Post-Quantum Cryptography PQC Transition
Quantifying the Advantage and Future Prospects
Simulations on IBM’s Qiskit platform have been used to thoroughly verify the algorithm’s accuracy. Its 96% success rate for a 4-vertex graph example is similar to that of other well-known Grover-based techniques.
There are significant benefits to the suggested algorithm in terms of quantum resource utilization. Although the QPDE stage has a gate complexity of, its overall impact is lessened because this phase is only carried out once throughout the search process. The overall gate complexity is still competitive at. The worst-case quantum bit complexity is outperforming a number of other current techniques, such as Matheus and Haverly. Despite having fewer qubit, the Arpita method has more Grover iterations and a marginally lower success probability because of its larger solution space.
A promising approach to handling ever-more complex network studies is provided by this novel algorithm, especially for large-scale graphs for which classical solutions are still computationally unfeasible. In order to further minimize quantum resource overhead, future research will concentrate on examining advanced encoding techniques, circuit design optimisation, and alternate QPDE procedures to lessen its computing cost.
You can also read China Launches Thin Film Lithium Niobate & CHIPX Pilot Line
