Matches in SemOpenAlex for { <https://semopenalex.org/work/W3200714110> ?p ?o ?g. }
Showing items 1 to 87 of
87
with 100 items per page.
- W3200714110 endingPage "710" @default.
- W3200714110 startingPage "710" @default.
- W3200714110 abstract "In this work we propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a<mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML><mml:mi>C</mml:mi><mml:mi>N</mml:mi><mml:mi>O</mml:mi><mml:mi>T</mml:mi></mml:math>gate count very close to the current theoretical lower bounds. In particular, it turns out that<mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML><mml:mn>15</mml:mn></mml:math>and<mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML><mml:mn>63</mml:mn></mml:math><mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML><mml:mi>C</mml:mi><mml:mi>N</mml:mi><mml:mi>O</mml:mi><mml:mi>T</mml:mi></mml:math>gates are sufficient to decompose a general<mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML><mml:mn>3</mml:mn></mml:math>- and<mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML><mml:mn>4</mml:mn></mml:math>-qubit unitary, respectively, with high numerical accuracy. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition. In addition, the algorithm can be adopted to sparse inter-qubit connectivity architectures provided by current mid-scale quantum computers, needing only a few additional<mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML><mml:mi>C</mml:mi><mml:mi>N</mml:mi><mml:mi>O</mml:mi><mml:mi>T</mml:mi></mml:math>gates to be implemented in the resulting quantum circuits." @default.
- W3200714110 created "2021-09-27" @default.
- W3200714110 creator A5006903663 @default.
- W3200714110 creator A5018285963 @default.
- W3200714110 date "2022-05-11" @default.
- W3200714110 modified "2023-10-18" @default.
- W3200714110 title "Approaching the theoretical limit in quantum gate decomposition" @default.
- W3200714110 cites W1605974080 @default.
- W3200714110 cites W1635919617 @default.
- W3200714110 cites W1968850365 @default.
- W3200714110 cites W1983474581 @default.
- W3200714110 cites W1984167858 @default.
- W3200714110 cites W2002372750 @default.
- W3200714110 cites W2003656163 @default.
- W3200714110 cites W2025626352 @default.
- W3200714110 cites W2046761109 @default.
- W3200714110 cites W2084040475 @default.
- W3200714110 cites W2084500851 @default.
- W3200714110 cites W2102008187 @default.
- W3200714110 cites W2104590612 @default.
- W3200714110 cites W2149381887 @default.
- W3200714110 cites W2586874551 @default.
- W3200714110 cites W2604388771 @default.
- W3200714110 cites W2811032035 @default.
- W3200714110 cites W2893036903 @default.
- W3200714110 cites W2918822786 @default.
- W3200714110 cites W2930242962 @default.
- W3200714110 cites W3009404572 @default.
- W3200714110 cites W3013754363 @default.
- W3200714110 cites W3032429584 @default.
- W3200714110 cites W3049704700 @default.
- W3200714110 cites W3101373235 @default.
- W3200714110 cites W3103438630 @default.
- W3200714110 cites W3105037323 @default.
- W3200714110 cites W3110598416 @default.
- W3200714110 cites W3111297213 @default.
- W3200714110 cites W3119402126 @default.
- W3200714110 cites W3129004273 @default.
- W3200714110 cites W3129110052 @default.
- W3200714110 cites W3171124006 @default.
- W3200714110 cites W3171158593 @default.
- W3200714110 cites W3216031933 @default.
- W3200714110 cites W3216823464 @default.
- W3200714110 cites W4214869207 @default.
- W3200714110 cites W4245032453 @default.
- W3200714110 cites W4247111930 @default.
- W3200714110 cites W4287115917 @default.
- W3200714110 doi "https://doi.org/10.22331/q-2022-05-11-710" @default.
- W3200714110 hasPublicationYear "2022" @default.
- W3200714110 type Work @default.
- W3200714110 sameAs 3200714110 @default.
- W3200714110 citedByCount "8" @default.
- W3200714110 countsByYear W32007141102021 @default.
- W3200714110 countsByYear W32007141102022 @default.
- W3200714110 countsByYear W32007141102023 @default.
- W3200714110 crossrefType "journal-article" @default.
- W3200714110 hasAuthorship W3200714110A5006903663 @default.
- W3200714110 hasAuthorship W3200714110A5018285963 @default.
- W3200714110 hasBestOaLocation W32007141101 @default.
- W3200714110 hasConcept C11413529 @default.
- W3200714110 hasConcept C154945302 @default.
- W3200714110 hasConcept C41008148 @default.
- W3200714110 hasConceptScore W3200714110C11413529 @default.
- W3200714110 hasConceptScore W3200714110C154945302 @default.
- W3200714110 hasConceptScore W3200714110C41008148 @default.
- W3200714110 hasLocation W32007141101 @default.
- W3200714110 hasLocation W32007141102 @default.
- W3200714110 hasLocation W32007141103 @default.
- W3200714110 hasOpenAccess W3200714110 @default.
- W3200714110 hasPrimaryLocation W32007141101 @default.
- W3200714110 hasRelatedWork W2051487156 @default.
- W3200714110 hasRelatedWork W2073681303 @default.
- W3200714110 hasRelatedWork W2317200988 @default.
- W3200714110 hasRelatedWork W2358668433 @default.
- W3200714110 hasRelatedWork W2376932109 @default.
- W3200714110 hasRelatedWork W2382290278 @default.
- W3200714110 hasRelatedWork W2386767533 @default.
- W3200714110 hasRelatedWork W2390279801 @default.
- W3200714110 hasRelatedWork W2748952813 @default.
- W3200714110 hasRelatedWork W2899084033 @default.
- W3200714110 hasVolume "6" @default.
- W3200714110 isParatext "false" @default.
- W3200714110 isRetracted "false" @default.
- W3200714110 magId "3200714110" @default.
- W3200714110 workType "article" @default.