Decompositions of \(n\)-qubit Toffoli gates with linear circuit complexity (Q1701223): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10773-017-3389-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2609567360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computational networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid solution of problems by quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal quantum computation with ideal Clifford gates and noisy ancillas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis and optimization of reversible circuits—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3171713 / rank
 
Normal rank

Latest revision as of 04:48, 15 July 2024

scientific article
Language Label Description Also known as
English
Decompositions of \(n\)-qubit Toffoli gates with linear circuit complexity
scientific article

    Statements

    Identifiers