arXiv subjects

Wojciech Bruzda

Publications and source records attributed to Wojciech Bruzda.

17 recordsLinked to original sources

arXiv2026

On Non-Existence of Absolutely Maximally Entangled Canonical Graph States in Even Local Dimensions

We demonstrate that absolutely maximally entangled (AME) states consisting of $N=4n$ qudits with $n\in\{1,2,3,\ldots\}$, each of even local dimension $d$, cannot be realized as canonical graph states over the ring $\mathbb{Z}_d$. This result imposes strong constraints on AME states in composite local dimensions and characterizes the limitations of graph-state constructions for highly entangled multipartite quantum systems. Furthermore, for $d\equiv 2\pmod 4$ this obstruction, combined with the prime-power decomposition of stabilizer states, excludes all pure stabilizer AME states (including four quhexes), while clarifying the distinction between canonical $\mathbb{Z}_{d}$ graph states and stabilizer constructions over prime-power factors. We also discuss a composite construction of mixed $k$-uniform states. For $(N,d)=(4,6)$, the construction yields a rank-two mixed $2$-uniform stabilizer state of purity $1/2$, which is optimal among normalized stabilizer projectors.

quant-ph↗

arXiv2026

Equi-Entropic Maps for Four-Partite Quantum States

Absolutely maximally entangled states represent a highly constrained form of multipartite entanglement and play an important role in quantum information theory. We investigate a weaker form of uniformity of entanglement for four-party systems of local dimension $d>2$ that requires the three balanced bipartitions to have equal but not necessarily maximal linear entropy. We introduce a linear map $Ξ$ that enforces exact equality of entropies under reshuffling and partial transposition. The transformation arises as the asymptotic limit of an iterative averaging procedure and admits a group-theoretic description in terms of permutations of tensor indices. For Haar-random unitary inputs, a leading-moment analysis supported by numerical simulations predicts highly entangled outputs whose common entropy approaches the maximal value as the local dimension grows. We characterize the algebraic structure, fixed points, and asymptotic behavior of this map and its relation to two-unitary matrices and orthogonal Latin squares.

quant-ph↗

arXiv2025

Certifying Majorana Fermions with Elegant-Like Bell Inequalities and a New Self-Testing Equivalence

Bell inequalities provide a fundamental tool for probing nonlocal correlations, yet their quantum bound, that is, the maximal value attainable through quantum strategies, is rarely accessible analytically. In this work, we introduce a general construction of Bell inequalities for which this bound can be computed exactly. Our framework generalizes both the Clauser-Horne-Shimony-Holt and Gisin's elegant inequalities, yielding Bell expressions maximally violated by any number of pairwise anticommuting Clifford observables together with the corresponding maximally entangled state. Under suitable assumptions, our inequalities also enable the device-independent certification of Majorana fermions, understood as multiqubit realizations of Clifford algebra generators. Importantly, we identify an additional equivalence that must be incorporated into the definition of self-testing beyond invariance under local isometries and transposition. This equivalence arises from partial transposition applied to the shared state and to the measurements, which in specific cases leaves all observed correlations unchanged.

quant-ph↗

arXiv2025

Equivalence of Genuine Multipartite Entanglement and Nonlocality of Nearly Symmetric Multiqubit Pure States

Whether every pure genuinely multipartite entangled (GME) state necessarily exhibits genuine multipartite nonlocality (GMNL) remains an open question. By combining a recently proposed Bell inequality [I. Stachura \textit{et al.}, \href{https://iopscience.iop.org/article/10.1088/1367-2630/ad7753}{New J. Phys. \textbf{26}, 093029 (2024)}] with Hardy's paradox and the canonical decomposition of pure states, we analytically demonstrate that all highly symmetric, genuinely entangled multipartite qubit states exhibit genuine multipartite nonlocality, thereby supporting Gisin's conjecture in the multipartite setting. This result constitutes a step toward a general proof of the conjectured equivalence between GME and GMNL in quantum theory.

quant-ph↗

arXiv2025

Robust Self-Testing of Multiqudit Supersinglet Slater States via Constant Number of Binary Measurements

Self-testing is a powerful device-independent technique that enables one to deduce the forms of both the quantum state and the measurements involved in a physical experiment based solely on observed correlations. Although numerous schemes for self-testing multipartite entangled states have been proposed, they are typically difficult to implement experimentally, as their complexity increases significantly with the number of subsystems or the local dimension. In this work, we introduce the first self-testing scheme of a relevant class of multiqudit genuinely entangled states that exploits only a constant number of binary measurements per observer, which significantly reduces the experimental effort to implement the scheme. Specifically, it enables the self-testing of multipartite Slater (or supersinglet) states composed of $d$ qu\textit{d}its with odd $d$ using only four two-outcome measurements per observer. Moreover, we prove that our scheme is robust to noise and experimental imperfections. For systems of even local dimension $d$, we also provide an adapted version of the scheme that requires only $d$ binary measurements per observer.

quant-ph↗

arXiv2025

Quantum Circuits for High-Dimensional Absolutely Maximally Entangled States

Absolutely maximally entangled (AME) states of multipartite quantum systems exhibit maximal entanglement across all possible bipartitions. These states lead to teleportation protocols that surpass standard teleportation schemes, determine quantum error correction codes and can be used to test performance of current term quantum processors. Several AME states can be constructed from graph states using minimal quantum resources. However, there exist other constructions that depart from the stabilizer formalism. In this work, we present explicit quantum circuits to generate exemplary non-stabilizer AME states of four subsystems with four, six, and eight levels each and analyze their capabilities to perform quantum information tasks.

quant-ph↗

arXiv2024

Multi-Unitary Complex Hadamard Matrices

We analyze the set of real and complex Hadamard matrices with additional symmetry constrains. In particular, we link the problem of existence of maximally entangled multipartite states of $2k$ subsystems with $d$ levels each to the set of complex Hadamard matrices of order $N=d^k$. To this end, we investigate possible subsets of such matrices which are, dual, strongly dual ($H=H^{\rm R}$ or $H=H^{\rmΓ}$), two-unitary ($H^R$ and $H^Γ$ are unitary), or $k$-unitary. Here $X^{\rm R}$ denotes reshuffling of a matrix $X$ describing a bipartite system, and $X^{\rm Γ}$ its partial transpose. Such matrices find several applications in quantum many-body theory, tensor networks and classification of multipartite quantum entanglement and imply a broad class of analytically solvable quantum models in $1+1$ dimensions.

quant-ph↗

arXiv2024

Two-Unitary Complex Hadamard Matrices of Order $36$

A family of two-unitary complex Hadamard matrices (CHM) stemming from a particular matrix, of size $36$ is constructed. Every matrix in this orbit remains unitary after operations of partial transpose and reshuffling which makes it a distinguished subset of CHM. It provides a novel solution to the quantum version of the Euler problem, in which each field of the Graeco-Latin square of size six contains a symmetric superposition of all $36$ officers with phases being multiples of sixth root of unity. This simplifies previously known solutions as all amplitudes of the superposition are equal and the set of phases consists of $6$ elements only. Multidimensional parameterization allows for more flexibility in a potential experimental realization.

quant-ph↗

arXiv2023

Block-Circulant Complex Hadamard Matrices

A new method of obtaining a sequence of isolated complex Hadamard matrices (CHM) for dimensions $N\geqslant 7$, based on block-circulant structures, is presented. We discuss, several analytic examples resulting from a modification of the Sinkhorn algorithm. In particular, we present new isolated matrices of orders $9$, $10$ and $11$, which elements are not roots of unity, and also several new multiparametric families of order $10$. We note novel connections between certain eight-dimensional matrices and provide new insights towards classification of CHM for $N\geqslant 7$. These contributions can find real applications in Quantum Information Theory and constructions of new families of Mutually Unbiased Bases or Unitary Error Bases.

quant-ph↗

arXiv2023

Local hidden variable values without optimization procedures

The problem of computing the local hidden variable (LHV) value of a Bell inequality plays a central role in the study of quantum nonlocality. In particular, this problem is the first step towards characterizing the LHV polytope of a given scenario. In this work, we establish a relation between the LHV value of bipartite Bell inequalities and the mathematical notion of excess of a matrix. Inspired by the well developed theory of excess, we derive several results that directly impact the field of quantum nonlocality. We show infinite families of bipartite Bell inequalities for which the LHV value can be computed exactly, without needing to solve any optimization problem, for any number of measurement settings. We also find tight Bell inequalities for a large number of measurement settings.

quant-ph↗

arXiv2022

9 $\times$ 4 = 6 $\times$ 6: Understanding the quantum solution to the Euler's problem of 36 officers

The famous combinatorial problem of Euler concerns an arrangement of $36$ officers from six different regiments in a $6 \times 6$ square array. Each regiment consists of six officers each belonging to one of six ranks. The problem, originating from Saint Petersburg, requires that each row and each column of the array contains only one officer of a given rank and given regiment. Euler observed that such a configuration does not exist. In recent work, we constructed a solution to a quantum version of this problem assuming that the officers correspond to quantum states and can be entangled. In this paper, we explain the solution which is based on a partition of 36 officers into nine groups, each with four elements. The corresponding quantum states are locally equivalent to maximally entangled two-qubit states, hence each officer is entangled with at most three out of his $35$ colleagues. The entire quantum combinatorial design involves $9$ Bell bases in nine complementary $4$-dimensional subspaces.

quant-ph↗

arXiv2022

Structured Unitary Matrices and Quantum Entanglement

We explore the set of unitary matrices characterized by a given structure in the context of their applications in the field of Quantum Information. In the first part of the Thesis we focus on classification of special classes of unitary matrices and possibility of introducing certain internal parameterizations. Several new results and conjectures are discussed. Second part of the Thesis is devoted to the concept of multipartite quantum entanglement. We present a solution to the problem of absolutely maximally entangled states of four subsystems with six levels each. Finally, we analyze the excess of a matrix and the corresponding Bell inequalities. This combination allows us to draw new conclusions related to quantum nonlocality.

quant-ph↗

arXiv2022

Tensor rank and entanglement of pure quantum states

The rank of a tensor is analyzed in context of quantum entanglement. A pure quantum state $\bf v$ of a composite system consisting of $d$ subsystems with $n$ levels each is viewed as a vector in the $d$-fold tensor product of $n$-dimensional Hilbert space and can be identified with a tensor with $d$ indices, each running from $1$ to $n$. We discuss the notions of the generic rank and the maximal rank of a tensor and review results known for the low dimensions. Another variant of this notion, called the border rank of a tensor, is shown to be relevant for characterization of orbits of quantum states generated by the group of special linear transformations. A quantum state ${\bf v}$ is called {\sl entangled}, if it {\sl cannot} be written in the product form, ${\bf v} \ne {\bf v}_1 \otimes {\bf v}_2 \otimes \cdots \otimes {\bf v}_d$, what implies correlations between physical subsystems. A relation between various ranks and norms of a tensor and the entanglement of the corresponding quantum state is revealed..

quant-ph↗

arXiv2021

Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem

The negative solution to the famous problem of $36$ officers of Euler implies that there are no two orthogonal Latin squares of order six. We show that the problem has a solution, provided the officers are entangled, and construct orthogonal quantum Latin squares of this size. As a consequence, we find an example of the long-elusive Absolutely Maximally Entangled state AME$(4,6)$ of four subsystems with six levels each, equivalently a $2$-unitary matrix of size $36$, which maximizes the entangling power among all bipartite unitary gates of this dimension, or a perfect tensor with four indices, each running from one to six. This special state deserves the appellation golden AME state as the golden ratio appears prominently in its elements. This result allows us to construct a pure nonadditive quhex quantum error detection code $(\!(3,6,2)\!)_6$, which saturates the Singleton bound and allows one to encode a $6$-level state into a triplet of such states.

quant-ph↗

arXiv2010

Universality of spectra for interacting quantum chaotic systems

We analyze a model quantum dynamical system subjected to periodic interaction with an environment, which can describe quantum measurements. Under the condition of strong classical chaos and strong decoherence due to large coupling with the measurement device, the spectra of the evolution operator exhibit an universal behavior. A generic spectrum consists of a single eigenvalue equal to unity, which corresponds to the invariant state of the system, while all other eigenvalues are contained in a disk in the complex plane. Its radius depends on the number of the Kraus measurement operators, and determines the speed with which an arbitrary initial state converges to the unique invariant state. These spectral properties are characteristic of an ensemble of random quantum maps, which in turn can be described by an ensemble of real random Ginibre matrices. This will be proven in the limit of large dimension.

quant-ph↗

arXiv2008

Random Quantum Operations

We define a natural ensemble of trace preserving, completely positive quantum maps and present algorithms to generate them at random. Spectral properties of the superoperator Phi associated with a given quantum map are investigated and a quantum analogue of the Frobenius-Perron theorem is proved. We derive a general formula for the density of eigenvalues of Phi and show the connection with the Ginibre ensemble of real non-symmetric random matrices. Numerical investigations of the spectral gap imply that a generic state of the system iterated several times by a fixed generic map converges exponentially to an invariant state.

nlin.SI↗

arXiv2007

Mubs and Hadamards of Order Six

We report on a search for mutually unbiased bases (MUBs) in 6 dimensions. We find only triplets of MUBs, and thus do not come close to the theoretical upper bound 7. However, we point out that the natural habitat for sets of MUBs is the set of all complex Hadamard matrices of the given order, and we introduce a natural notion of distance between bases in Hilbert space. This allows us to draw a detailed map of where in the landscape the MUB triplets are situated. We use available tools, such as the theory of the discrete Fourier transform, to organise our results. Finally we present some evidence for the conjecture that there exists a four dimensional family of complex Hadamard matrices of order 6. If this conjecture is true the landscape in which one may search for MUBs is much larger than previously thought.

quant-ph↗