Matches in SemOpenAlex for { <https://semopenalex.org/work/W4386081366> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W4386081366 abstract "The resolution of hard combinatorial problems is essential in a wide range of industrial applications and theoretical fields. Quantum computers offer a unique platform for addressing such problems, with the Quantum Approximate Optimization Algorithm (QAOA) being a state-of-the-art example. However, due to high levels of noise and limited numbers of qubits in current quantum devices, only very small problem instances can be addressed on actual quantum hardware. Here we present a new variational Qubit-Efficient MaxCut (QEMC) algorithm that is specifically designed to find heuristic solutions for the MaxCut problem, a well-studied NP-hard combinatorial problem. The QEMC method introduces a unique information encoding scheme that requires $log{N}$ qubits to address graphs with $N$ nodes, an exponential reduction in comparison to QAOA. Each node of the graph is assigned to a unique computational quantum state, and its logical state is depicted by the measurement probability of the corresponding state, using a probability-threshold encoding scheme. Consequently, each partition of the graph is associated with a volume of states, rather than with just a single state. We present noiseless QEMC simulations on regular graphs with up to 2048 nodes (11 qubits). These simulations achieved cut solutions that outperform those obtained by the best-known classical approximation algorithm of Goemans and Williamson (GW), by several percent. Moreover, executing the QEMC algorithm on actual IBM quantum devices achieved leading-edge results for graphs with up to 32 nodes (5 qubits), providing a challenging benchmark for the QAOA algorithm. We analyze the computational complexity of the QEMC algorithm and show that it can be simulated efficiently using classical methods, thereby constituting a new quantum-inspired classical MaxCut heuristic." @default.
- W4386081366 created "2023-08-23" @default.
- W4386081366 creator A5043126914 @default.
- W4386081366 creator A5069034712 @default.
- W4386081366 creator A5092810089 @default.
- W4386081366 creator A5092810090 @default.
- W4386081366 date "2023-08-20" @default.
- W4386081366 modified "2023-09-27" @default.
- W4386081366 title "A Variational Qubit-Efficient MaxCut Heuristic Algorithm" @default.
- W4386081366 doi "https://doi.org/10.48550/arxiv.2308.10383" @default.
- W4386081366 hasPublicationYear "2023" @default.
- W4386081366 type Work @default.
- W4386081366 citedByCount "0" @default.
- W4386081366 crossrefType "posted-content" @default.
- W4386081366 hasAuthorship W4386081366A5043126914 @default.
- W4386081366 hasAuthorship W4386081366A5069034712 @default.
- W4386081366 hasAuthorship W4386081366A5092810089 @default.
- W4386081366 hasAuthorship W4386081366A5092810090 @default.
- W4386081366 hasBestOaLocation W43860813661 @default.
- W4386081366 hasConcept C111335779 @default.
- W4386081366 hasConcept C11413529 @default.
- W4386081366 hasConcept C121332964 @default.
- W4386081366 hasConcept C126255220 @default.
- W4386081366 hasConcept C132525143 @default.
- W4386081366 hasConcept C13280743 @default.
- W4386081366 hasConcept C137019171 @default.
- W4386081366 hasConcept C165526019 @default.
- W4386081366 hasConcept C173801870 @default.
- W4386081366 hasConcept C185798385 @default.
- W4386081366 hasConcept C203087015 @default.
- W4386081366 hasConcept C205649164 @default.
- W4386081366 hasConcept C2524010 @default.
- W4386081366 hasConcept C33923547 @default.
- W4386081366 hasConcept C41008148 @default.
- W4386081366 hasConcept C48103436 @default.
- W4386081366 hasConcept C58053490 @default.
- W4386081366 hasConcept C62520636 @default.
- W4386081366 hasConcept C80444323 @default.
- W4386081366 hasConcept C84114770 @default.
- W4386081366 hasConceptScore W4386081366C111335779 @default.
- W4386081366 hasConceptScore W4386081366C11413529 @default.
- W4386081366 hasConceptScore W4386081366C121332964 @default.
- W4386081366 hasConceptScore W4386081366C126255220 @default.
- W4386081366 hasConceptScore W4386081366C132525143 @default.
- W4386081366 hasConceptScore W4386081366C13280743 @default.
- W4386081366 hasConceptScore W4386081366C137019171 @default.
- W4386081366 hasConceptScore W4386081366C165526019 @default.
- W4386081366 hasConceptScore W4386081366C173801870 @default.
- W4386081366 hasConceptScore W4386081366C185798385 @default.
- W4386081366 hasConceptScore W4386081366C203087015 @default.
- W4386081366 hasConceptScore W4386081366C205649164 @default.
- W4386081366 hasConceptScore W4386081366C2524010 @default.
- W4386081366 hasConceptScore W4386081366C33923547 @default.
- W4386081366 hasConceptScore W4386081366C41008148 @default.
- W4386081366 hasConceptScore W4386081366C48103436 @default.
- W4386081366 hasConceptScore W4386081366C58053490 @default.
- W4386081366 hasConceptScore W4386081366C62520636 @default.
- W4386081366 hasConceptScore W4386081366C80444323 @default.
- W4386081366 hasConceptScore W4386081366C84114770 @default.
- W4386081366 hasLocation W43860813661 @default.
- W4386081366 hasOpenAccess W4386081366 @default.
- W4386081366 hasPrimaryLocation W43860813661 @default.
- W4386081366 hasRelatedWork W2901445955 @default.
- W4386081366 hasRelatedWork W2951211905 @default.
- W4386081366 hasRelatedWork W2963768709 @default.
- W4386081366 hasRelatedWork W3128569495 @default.
- W4386081366 hasRelatedWork W4289293126 @default.
- W4386081366 hasRelatedWork W4292636030 @default.
- W4386081366 hasRelatedWork W4384648128 @default.
- W4386081366 hasRelatedWork W4385750388 @default.
- W4386081366 hasRelatedWork W4386044005 @default.
- W4386081366 hasRelatedWork W4287333466 @default.
- W4386081366 isParatext "false" @default.
- W4386081366 isRetracted "false" @default.
- W4386081366 workType "article" @default.