Adding loop composition to branching quantum walk models produces a variable-time quantum search algorithm whose complexity matches the best known results.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Spectral bounds relate graph Laplacian eigenvalues to the congestion of binary-tree embeddings, with an efficient spectral-ordering algorithm and applications to tensor-network contraction complexity.
GeneCS compiler reduces ancillary qubits and checks by over 85% on average for single- and cross-code logical operations on stabilizer codes while preserving error rates and scaling to over 10,000 qubits.
citing papers explorer
-
Loop Composition in Quantum Algorithms
Adding loop composition to branching quantum walk models produces a variable-time quantum search algorithm whose complexity matches the best known results.
-
Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
Spectral bounds relate graph Laplacian eigenvalues to the congestion of binary-tree embeddings, with an efficient spectral-ordering algorithm and applications to tensor-network contraction complexity.
-
GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes
GeneCS compiler reduces ancillary qubits and checks by over 85% on average for single- and cross-code logical operations on stabilizer codes while preserving error rates and scaling to over 10,000 qubits.