Results 21 to 30 of about 57,717 (241)
The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model [PDF]
Theory of Quantum Computation, Communication, and Cryptography, 2021 The Quantum Approximate Optimization Algorithm (QAOA) finds approximate solutions to combinatorial optimization problems. Its performance monotonically improves with its depth $p$. We apply the QAOA to MaxCut on large-girth $D$-regular graphs. We give an
J. Basso +4 more
semanticscholar +1 more source
Classical algorithms and quantum limitations for maximum cut on high-girth graphs [PDF]
Information Technology Convergence and Services, 2021 We study the performance of local quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) for the maximum cut problem, and their relationship to that of classical algorithms.
B. Barak, Kunal Marwaha
semanticscholar +1 more source
Local classical MAX-CUT algorithm outperforms p=2 QAOA on high-girth regular graphs [PDF]
Quantum, 2021 The p-stage Quantum Approximate Optimization Algorithm (QAOAp) is a promising approach for combinatorial optimization on noisy intermediate-scale quantum (NISQ) devices, but its theoretical behavior is not well understood beyond p=1. We analyze QAOA2 for
Kunal Marwaha
semanticscholar +1 more source
A Unifying Framework to Construct QC-LDPC Tanner Graphs of Desired Girth [PDF]
IEEE Transactions on Information Theory, 2021 This paper presents a unifying framework to construct low-density parity-check (LDPC) codes with associated Tanner graphs of desired girth. Towards this goal, we highlight the role that a certain square matrix that appears in the product of the parity ...
R. Smarandache, David G. M. Mitchell
semanticscholar +1 more source
Motivations and Psychological Characteristics of Men Seeking Penile Girth Augmentation
Aesthetic surgery journal, 2022 Background The popularity of penile augmentation procedures is increasing, but little is known about the motivations and psychological characteristics of men who seek these procedures. Objectives Employing valid psychological measures, the authors sought
G. Sharp +4 more
semanticscholar +1 more source
On connected graphs of order n with girth g and nullity n-g [PDF]
, 2023 Let G be a simple graph of order n. The nullity of a graph G, denoted by , is the multiplicity of 0 as an eigenvalue of its adjacency matrix. If G has at least one cycle, then the girth of G, denoted by , is the length of the shortest cycle in G.
Zhou, Q.;Wong, D.;Tam, B.-S.
core +1 more source
Girth in Neutrosophic Graphs [PDF]
, 2022 In this book, some notions are introduced about “Girth in Neutrosophic Graphs.” Three chapters are devised as “Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs”, “Neutrosophic Girth Based On Neutrosophic Cycle in Neutrosophic Graphs” and ...
Henry Garrett
core +1 more source
GIRTH: G. Item Response Theory [PDF]
, 2021 Removed Numba Dependency No major features or bugs were fixed in this release. The dependency on Numba was removed to address some issue. This release, and others moving forward, should play nice with google colab and pyodide.If you use this software ...
Sanchez, Ryan
core +1 more source
Petroleum Science, 2021 Pipeline inner inspection technology based on Pipeline Inspection Gauge (PIG), is the primary means for ensuring the safety of submarine pipelines. The dynamic characteristics of a PIG can change abruptly with the excitation of obstacles such as girth ...
Hang Zhang +4 more
semanticscholar +1 more source
On Hypergraphs of Girth Five [PDF]
The Electronic Journal of Combinatorics, 2003 In this paper, we study $r$-uniform hypergraphs ${\cal H}$ without cycles of length less than five, employing the definition of a hypergraph cycle due to Berge. In particular, for $r = 3$, we show that if ${\cal H}$ has $n$ vertices and a maximum number of edges, then $$|{\cal H}|={\textstyle 1\over6}n^{3/2} + o(n^{3/2}).$$ This also asymptotically ...
Felix Lazebnik, Jacques Verstraëte
openaire +2 more sources