Image de couverture de livre

Perfect state transfer using Markovian quantum walk

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Dutta, Supriyo
Format:	Preprint
Publié:	2022
Sujets:	Quantum Physics Discrete Mathematics Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Discrete-Time Open Quantum Walks for Vertex Ranking in Graphs
par: Dutta, Supriyo
Publié: (2024)

Preparing graph states forbidding a vertex-minor
par: Davies, James, et autres
Publié: (2025)

Random sampling of permutations through quantum circuits
par: Adhikari, Bibhas
Publié: (2024)

Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
par: Farhi, Edward, et autres
Publié: (2025)

Planar #CSP Equality Corresponds to Quantum Isomorphism -- A Holant Viewpoint
par: Cai, Jin-Yi, et autres
Publié: (2022)

Krenn-Gu conjecture for sparse graphs
par: Chandran, L. Sunil, et autres
Publié: (2024)

$ε$-Uniform Mixing in Discrete Quantum Walks
par: Zhan, Hanmeng
Publié: (2023)

Discrete Quantum Walks with Marked Vertices and Their Average Vertex Mixing Matrices
par: Mohan, Amulya, et autres
Publié: (2024)

Simple Quantum Coins Enable Pretty Good State Transfer on Every Hypercube
par: Zhan, Hanmeng
Publié: (2024)

Sunflowers and Ramsey problems for restricted intersections
par: Janzer, Barnabás, et autres
Publié: (2025)

Quantum circuit model for discrete-time three-state quantum walks on Cayley graphs
par: Sarkar, Rohit Sarma, et autres
Publié: (2024)

All $S_p$ notions of quantum expansion are equivalent
par: Gutiérrez, Francisco Escudero, et autres
Publié: (2024)

Almost Perfect Mutually Unbiased Bases that are Sparse
par: Kumar, Ajeet, et autres
Publié: (2024)

On de Bruijn Rings and Families of Almost Perfect Maps
par: Stelldinger, Peer
Publié: (2024)

HBS Tilings Extended: State of the Art and Novel Observations
par: Porrier, Carole
Publié: (2023)

Edge coloring lattice graphs
par: Kattemölle, Joris
Publié: (2024)

Subspace State Transfer in Coined Quantum Walks
par: Xu, Yichi, et autres
Publié: (2025)

Toward Minimum Graphic Parity Networks
par: Cao, Yixin, et autres
Publié: (2025)

Speeding up random walk mixing by starting from a uniform vertex
par: Díaz, Alberto Espuny, et autres
Publié: (2022)

Community detection in network using Szegedy quantum walk
par: Rahaman, Md Samsur, et autres
Publié: (2026)

Cutoff profile of the Metropolis biased card shuffling
par: Zhang, Lingfu
Publié: (2022)

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
par: Bencs, Ferenc, et autres
Publié: (2023)

Reconsideration of Tangle and Ultrafilter using Separation and Partition
par: Fujita, Takaaki
Publié: (2023)

Characterization of Word-Representable Graphs using Modular Decomposition
par: Dwary, Tithi, et autres
Publié: (2024)

A new heuristic approach for contextuality degree estimates and its four- to six-qubit portrayals
par: Muller, Axel, et autres
Publié: (2024)

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
par: Meunier, Anthony, et autres
Publié: (2026)

Type-B analogue of Bell numbers using Rota's Umbral calculus approach
par: Bagno, Eli, et autres
Publié: (2024)

3-colorable planar graphs have an intersection segment representation using 3 slopes
par: Gonçalves, Daniel
Publié: (2025)

Graph-theoretic insights on the constructability of complex entangled states
par: Chandran, L. Sunil, et autres
Publié: (2023)

Local equivalence of stabilizer states: a graphical characterisation
par: Claudet, Nathan, et autres
Publié: (2024)

No-go theorem for quantum realization of extremal correlations
par: K, Sujan V., et autres
Publié: (2025)

Polytopes of alternating sign matrices with dihedral-subgroup symmetry
par: Madarasi, Péter
Publié: (2026)

Vertex-minor universal graphs for generating entangled quantum subsystems
par: Cautrès, Maxime, et autres
Publié: (2024)

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
par: Kar, Prem Nigam, et autres
Publié: (2024)

Witness Set in Monotone Polygons: Exact and Approximate
par: Das, Udvas, et autres
Publié: (2025)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
par: Ghanbari, Babak, et autres
Publié: (2026)

Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
par: Montanez-Barrera, Alejandro, et autres
Publié: (2022)

The chromatic number of triangle-free hypergraphs
par: Li, Lina, et autres
Publié: (2022)

Acyclic colourings of graphs with obstructions
par: Chuet, Quentin, et autres
Publié: (2022)

Progress towards the two-thirds conjecture on locating-total dominating sets
par: Chakraborty, Dipayan, et autres
Publié: (2022)