Efficient quantum circuits for Szegedy quantum walks (Q2362658): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A classical approach to the graph isomorphism problem using quantum walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Quantum Simulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3166193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient quantum algorithms for simulating sparse Hamiltonians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3172449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum walks can find a marked element on any graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum verification of matrix products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum complexity of testing group commutativity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search via Quantum Walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3171602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hitting times of quantum versus random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum mixing of Markov chains for special distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating quantum systems on a quantum computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum networks for concentrating entanglement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $25,000,000,000 Eigenvector: The Linear Algebra behind Google / rank
 
Normal rank

Latest revision as of 02:18, 14 July 2024

scientific article
Language Label Description Also known as
English
Efficient quantum circuits for Szegedy quantum walks
scientific article

    Statements

    Efficient quantum circuits for Szegedy quantum walks (English)
    0 references
    0 references
    0 references
    11 July 2017
    0 references
    efficient quantum circuit
    0 references
    quantum walk
    0 references
    Szegedy walk
    0 references
    directed graph
    0 references
    quantum Pagerank
    0 references

    Identifiers