Cover Image

Almost Perfect Mutually Unbiased Bases that are Sparse

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kumar, Ajeet, Maitra, Subhamoy, Roy, Somjit
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Construction of Approximate Real Mutually Unbiased Bases for an infinite class of dimensions $d \not\equiv 0 \bmod 4$
by: Kumar, Ajeet, et al.
Published: (2025)

Further Constructions of AMUBs for Non-prime power Composite Dimensions
by: Kumar, Ajeet, et al.
Published: (2024)

On de Bruijn Rings and Families of Almost Perfect Maps
by: Stelldinger, Peer
Published: (2024)

On Obtaining New MUBs by Finding Points on Complete Intersection Varieties over $\mathbb{R}$
by: Banerjee, Arindam, et al.
Published: (2025)

Enumeration of Sets of Mutually Orthogonal Latin Rectangles
by: Jäger, Gerold, et al.
Published: (2019)

Flips and Merge-Width in Sparse Graphs
by: Drabik, Karolina, et al.
Published: (2026)

Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
by: Jeronimo, Fernando Granha, et al.
Published: (2022)

Note on the Number of Almost Ordinary Triangles
by: Dumitrescu, Adrian, et al.
Published: (2025)

On the Number of Almost Empty Monochromatic Triangles
by: Bhattacharya, Bhaswar B., et al.
Published: (2026)

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
by: Botler, F., et al.
Published: (2024)

Word-Representability of Shift Graphs
by: Roy, Suchanda, et al.
Published: (2026)

Characterization of Word-Representable Near-Triangulations
by: Roy, Suchanda, et al.
Published: (2026)

On the Word-Representability of 5-Regular Circulant Graphs
by: Roy, Suchanda, et al.
Published: (2025)

Word-Representability of Split Graphs with Independent Set of Size 4
by: Roy, Suchanda, et al.
Published: (2025)

Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion
by: Karol, Nikolai, et al.
Published: (2026)

Perfect state transfer using Markovian quantum walk
by: Dutta, Supriyo
Published: (2022)

Transitive Sets of Mutually Orthogonal Latin Squares
by: Keita, Amadou, et al.
Published: (2026)

Obstruction characterization of co-TT graphs
by: Das, Ashok Kumar, et al.
Published: (2023)

On powers of circular arc graphs
by: Das, Ashok Kumar, et al.
Published: (2022)

Extremal minimal bipartite matching covered graphs
by: Mallik, Amit Kumar, et al.
Published: (2024)

Vertex-Based Localization of Turán's Theorem
by: Adak, Rajat, et al.
Published: (2025)

An Efficient Genus Algorithm Based on Graph Rotations
by: Metzger, Alexander, et al.
Published: (2024)

Vertex-Based Localization of Generalized Turán Problems
by: Adak, Rajat, et al.
Published: (2025)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
by: Das, Sandip, et al.
Published: (2023)

Approximating the Network Design Problem for Potential-Based Flows
by: Klimm, Max, et al.
Published: (2026)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
by: Adak, Rajat, et al.
Published: (2025)

Sparse Approximation in Lattices and Semigroups
by: Kuhlmann, Stefan, et al.
Published: (2024)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
by: Korhonen, Tuukka, et al.
Published: (2024)

Sparse High Dimensional Expanders via Local Lifts
by: Yaacov, Inbar Ben, et al.
Published: (2024)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
by: Ghanbari, Babak, et al.
Published: (2026)

Palette Sparsification for Graphs with Sparse Neighborhoods
by: Dhawan, Abhishek
Published: (2024)

Asynchronous dynamics of isomorphic Boolean networks
by: Bridoux, Florian, et al.
Published: (2024)

HIST-Critical Graphs and Malkevitch's Conjecture
by: Goedgebeur, Jan, et al.
Published: (2024)

Grid Minors and Products
by: Dujmović, Vida, et al.
Published: (2024)

An explicit condition for boundedly supermultiplicative subshifts
by: Bui, Vuong, et al.
Published: (2024)

Large planar $(n,m)$-cliques
by: Bandopadhyay, Susobhan, et al.
Published: (2024)

On open-separating dominating codes in graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)

$θ$-free matching covered graphs
by: Joshi, Rohinee, et al.
Published: (2024)

Branch-depth is minor closure of contraction-deletion-depth
by: Briański, Marcin, et al.
Published: (2024)

On Iiro Honkala's contributions to identifying codes
by: Hudry, Olivier, et al.
Published: (2024)