|
|
|
|
| LEADER |
00000nam a22000003u 4500 |
| 001 |
b12829888 |
| 003 |
CoU |
| 005 |
20220914040000.0 |
| 006 |
m o d f |
| 007 |
cr ||||||||||| |
| 008 |
221019e20200716||| o| f0|||||eng|d |
| 035 |
|
|
|a (TOE)ost1756438
|
| 035 |
|
|
|a (TOE)1756438
|
| 040 |
|
|
|a TOE
|c TOE
|
| 049 |
|
|
|a GDWR
|
| 072 |
1 |
|
|a 71
|2 edbsc
|
| 086 |
0 |
|
|a E 1.99:1756438
|
| 086 |
0 |
|
|a E 1.99:1756438
|
| 245 |
0 |
0 |
|a Max-independent set and the quantum alternating operator ansatz
|h [electronic resource]
|
| 260 |
|
|
|a Washington, D.C. :
|b United States. Department of Energy. Office of Science ;
|a Oak Ridge, Tenn. :
|b Distributed by the Office of Scientific and Technical Information, U.S. Department of Energy,
|c 2020.
|
| 300 |
|
|
|a Size: Article No. 2050011 :
|b digital, PDF file.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent.
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia.
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier.
|
| 500 |
|
|
|a Published through Scitech Connect.
|
| 500 |
|
|
|a 07/16/2020.
|
| 500 |
|
|
|a "Journal ID: ISSN 0219-7499."
|
| 500 |
|
|
|a "Other: 161650."
|
| 500 |
|
|
|a ": US2205645."
|
| 500 |
|
|
|a Saleem, Zain Hamid ;
|
| 520 |
3 |
|
|a he maximum-independent set (MIS) problem of graph theory using the quantum alternating operator ansatz is studied. We perform simulations on the Rigetti Forest simulator for the square ring, K<sub>2,3</sub>, and K3,3 graphs and analyze the dependence of the algorithm on the depth of the circuit and initial states. The probability distribution of observation of the feasible states representing maximum-independent sets is observed to be asymmetric for the MIS problem, which is unlike the Max-Cut problem where the probability distribution of feasible states is symmetric. For asymmetric graphs, it is shown that the algorithm clearly favors the independent set with the larger number of elements even for finite circuit depth. Finally, we also compare the approximation ratios for the algorithm when we choose different initial states for the square ring graph and show that it is dependent on the choice of the initial state.
|
| 536 |
|
|
|b AC02-06CH11357.
|
| 650 |
|
7 |
|a 71 classical and quantum mechanics, general physics
|2 local.
|
| 650 |
|
7 |
|a Qaoa
|2 local.
|
| 650 |
|
7 |
|a Quantum algorithms
|2 local.
|
| 650 |
|
7 |
|a Constrained optimization
|2 local.
|
| 650 |
|
7 |
|a Classical and quantum mechanics, general physics
|2 local.
|
| 710 |
2 |
|
|a Argonne National Laboratory.
|4 res.
|
| 710 |
1 |
|
|a United States.
|b Department of Energy.
|b Office of Science.
|4 spn.
|
| 710 |
1 |
|
|a United States.
|b Department of Energy.
|b Office of Scientific and Technical Information
|4 dst.
|
| 856 |
4 |
0 |
|u https://www.osti.gov/servlets/purl/1756438
|z Full Text (via OSTI)
|
| 907 |
|
|
|a .b128298881
|b 02-28-23
|c 12-08-22
|
| 998 |
|
|
|a web
|b 12-08-22
|c f
|d m
|e p
|f eng
|g
|h 0
|i 1
|
| 956 |
|
|
|a Information bridge
|
| 999 |
f |
f |
|i cd0a39ba-c399-596e-8834-71b52eaf2386
|s 44779e54-d17d-50d4-ba5d-8ce35e34ad14
|
| 952 |
f |
f |
|p Can circulate
|a University of Colorado Boulder
|b Online
|c Online
|d Online
|e E 1.99:1756438
|h Superintendent of Documents classification
|i web
|n 1
|
