arXiv subjects

William Munizzi

Publications and source records attributed to William Munizzi.

15 recordsLinked to original sources

arXiv2026

Multi-purpose quantum laboratories from superconducting circuits

Superconducting circuits (SCs) are the cornerstone of modern quantum technology, enabling scalable computing through coherent control of macroscopic quantum states. Through a legacy that predates modern quantum computing, SCs have emerged as high-precision instruments for discovery. In this review, we highlight the role of SCs as general-purpose quantum laboratories, outlining the emerging landscape of correlated matter-circuit science. We review and unify the capabilities of superconducting quantum hardware across condensed matter, high energy and quantum information sciences. We trace the technical evolution of these architectures, illustrating how their foundational development has culminated in a toolkit for resolving the complexities of macroscopic quantum states.

quant-ph↗

arXiv2026

Magic and Non-Clifford Gates in Topological Quantum Field Theory

Non-Clifford gates, used to generate quantum magic, are essential for universal quantum computation. We show that non-Clifford gates arise naturally from path integrals in topological quantum field theories, where their magic-generating properties are determined by the algebraic data of the theory. In Chern-Simons theory, we construct the Ising interaction gate, whose generator is prepared by path integration over simple three-boundary manifolds, and show that it produces non-local magic away from discrete Clifford points. We show that the Toffoli gate is obstructed in $SU(2)_1$ by the $\mathbb{Z}_2$ fusion structure, while $SU(2)_3$ is the minimal theory supporting the required conditional logic, given the density of the mapping class group in the projective unitary group on the manifold boundary. Finally, we demonstrate that the T gate arises as a path integral in Dijkgraaf-Witten theory, with gauge group $\mathbb{Z}_4$, where a single Dehn twist on the boundary torus produces the gate without approximation. These results show that topological path integrals construct gates in multiple levels of the Clifford hierarchy, and across distinct classes of field theories, with implications for topological quantum computing.

hep-th↗

arXiv2025

Monogamy of Mutual Information in Graph States

The monogamy of mutual information (MMI) is a quantum entropy inequality that enforces the non-positivity of tripartite information. We investigate the failure of MMI in graph states as a forbidden-subgraph phenomenon, conjecturing that every MMI-violating graph state is local-Clifford equivalent to one whose graph contains a four-star subgraph. We construct a family of star-like graphs whose states fail a specific class of MMI instances, and extend this analysis to general star topologies. Deriving adjacency matrix constraints that fix the MMI evaluation for these instances and interpreting them physically, we prove the forbidden-subgraph conjecture for this family of graphs. Finally, through an exhaustive search over graph representatives for all $8$-qubit stabilizer entropy vectors, we establish that MMI failure is not reducible to the cases within our scope.

quant-ph↗

arXiv2025

Navigating the Quantum Resource Landscape of Entropy Vector Space Using Machine Learning and Optimization

We present a machine learning framework to study the dynamics of entropy vectors and quantum resources, including entanglement and magic, focusing on violations of entropy inequalities. Using a reinforcement learning agent formulated as a Markov decision process, we identify quantum circuits that optimally navigate the entropy vector space to generate violations of Ingleton's inequality. We complement this approach with a classical optimization algorithm to produce arbitrary numbers of Ingleton-violating states, with tunable degrees of violation, and empirically determine the maximal attainable violation for Ingleton's inequality. Our analysis reveals characteristic patterns of quantum resources that accompany Ingleton violation. A comprehensive statistical analysis shows that Ingleton-violating states occupy sharply-defined, isolated regions of the Hilbert space, and are extremely rare. Together, these results establish a unified computational toolkit for studying entropy vector dynamics, tracking quantum resource evolution, and engineering circuits with controlled information-theoretic features.

quant-ph↗

arXiv2025

A Compact Framework for Analyzing Asynchronous Entanglement Distribution in Quantum Networks

This work introduces a compact framework for analyzing asynchronous entanglement distribution protocols under realistic error models. We focus on two contemporary protocols: sequential, where entanglement is established one node at a time, and parallel, where all nodes attempt to generate entanglement simultaneously. We derive an analytical expression for the fidelity of distributed entangled states, showing that the fidelity depends only on the total time all qubits spend in memory, rather than the individual memory times for each qubit. This result distills the complex dynamics of entanglement distribution into a compact accessible form, providing an scalable tool for evaluating protocol efficiency. Using this lightweight framework, we analyze the performance of parallel and sequential protocols, demonstrating that parallel distribution consistently outperforms sequential and highlighting the potential of parallel protocols for practical quantum network implementations.

quant-ph↗

arXiv2025

Topological Preparation of Non-Stabilizer States and Clifford Evolution in $SU(2)_1$ Chern-Simons Theory

We develop a topological framework for preparing families of non-stabilizer states, and computing their entanglement entropies, in $SU(2)_1$ Chern-Simons theory. Using the Kac-Moody algebra, we construct Pauli and Clifford operators as path integrals over 3-manifolds with Wilson loop insertions, enabling an explicit topological realization of $W_n$ and Dicke states, as well as their entanglement properties. We further establish a correspondence between Clifford group action and modular transformations generated by Dehn twists on genus-$g$ surfaces, linking the mapping class group to quantum operations. Our results extend existing topological constructions for stabilizer states to include families of non-stabilizer states, improving the geometric interpretation of entanglement and quantum resources in topological quantum field theory.

hep-th↗

arXiv2025

Combining Error Detection and Mitigation: A Hybrid Protocol for Near-Term Quantum Simulation

Practical implementation of quantum error correction is currently limited by near-term quantum hardware. In contrast, quantum error mitigation has demonstrated strong promise for improving the performance of noisy quantum circuits without the requirement of full fault tolerance. In this work, we develop a hybrid error suppression protocol that integrates Pauli twirling, probabilistic error cancellation, and the $[[n, n-2, 2]]$ quantum error detecting code. In addition, to reduce overhead from error mitigation components of our method, we modify Pauli twirling by lowering the number of Pauli operators in the twirling set, and apply probabilistic error cancellation at the end of the encoded circuit to remove undetectable errors. Finally, we demonstrate our protocol on a non-Clifford variational quantum eigensolver circuit that estimates the ground state energy of $\rm H_2$ using both \texttt{qiskit} AerSimulator and the IBM quantum processor \texttt{ibm\_brussels}.

quant-ph↗

arXiv2025

Bounding Entanglement Entropy with Clifford Double Cosets

Following on our previous work arXiv:2204.07593 and arXiv:2306.01043 studying the orbits of quantum states under Clifford circuits via `reachability graphs', we introduce `contracted graphs' whose vertices represent classes of quantum states with the same entropy vector. These contracted graphs represent the double cosets of the Clifford group, where the left cosets are built from the stabilizer subgroup of the starting state and the right cosets are built from the entropy-preserving operators. We study contracted graphs for stabilizer states, as well as W states and Dicke states, discussing how the diameter of a state's contracted graph constrains the `entropic diversity' of its $2$-qubit Clifford orbit. We derive an upper bound on the number of entropy vectors that can be generated using any $n$-qubit Clifford circuit, for any quantum state. We speculate on the holographic implications for the relative proximity of gravitational duals of states within the same Clifford orbit. Although we concentrate on how entropy evolves under the Clifford group, our double-coset formalism, and thus the contracted graph picture, is extendable to generic gate sets and generic state properties.

quant-ph↗

arXiv2024

Efficient Multiparty Entanglement Distribution in Dynamic Quantum Networks

Distributing multipartite entanglement over a quantum network means routing it through a shared resource state. Existing measurement-based schemes search for a fresh path and re-verify the topology before every request, placing a network-wide classical exchange on the critical path of each one. We introduce DODAG-X, which removes it. A single destination-oriented directed acyclic graph spanning tree is computed once and reused across all requests, so each party's route is recovered by following parent pointers instead of by a new search. The per-request routing cost drops from $\mathcal{O}(N)$ to $\mathcal{O}(\sqrt{N})$ on symmetric grids and to $\mathcal{O}(\log N)$ on small-world networks for $N$ nodes, and only the $N-1$ tree links need be maintained under link loss. Routing on the sparse tree also shrinks the neighborhoods cleared to isolate the parties, lowering measurements per request by roughly 19\% on small-world graphs and up to 34\% on moderately dense, strongly rewired ones; on a fixed tree the two protocols use identical counts. We prove correctness for up to three parties with no restriction on topology, and prove a sufficient condition under which one application yields an $n$-party GHZ state for any $n$. We then delimit it, exhibiting requests outside the hypothesis whose output is multipartite entangled yet in a different local-Clifford class. Under a discrete-time Markov failure model the classical repair layer matches the reachability of full-graph re-search up to a failed-edge fraction of one half, and a coherence criterion relating tree depth to memory lifetime identifies the viable hardware platforms.

quant-ph↗

arXiv2024

Bit by Bit: Gravity Through the Lens of Quantum Information

This dissertation reviews several recent advances at the intersection of quantum information and holography. In holography, properties of quantum systems admit a gravitational interpretation via the AdS/CFT correspondence. For holographic states, boundary entanglement entropy is dual to bulk geodesic areas, known as Ryu-Takayanagi surfaces. Furthermore, the viability to possess a holographic dual at all is constrained by entanglement structure. Accordingly, entanglement enables a coarse classification of states in a Hilbert space. Similarly, state transformation under operator groups also provides a classification on the Hilbert space. Stabilizer states, for example, are invariant under large sets of operations and consequently can be simulated on a classical computer. Cayley graphs offer a useful representation for a group of operators, where vertices represent group elements and edges represent generators. The orbit of a state under action of the group can also be represented as a "reachability graph", a quotient of the group Cayley graph. Reachability graphs can be dressed to encode entanglement information, making them a useful tool for studying entanglement dynamics. Quotienting a reachability graph by group elements that fix a state computable, e.g. entanglement entropy, builds a "contracted graph". Contracted graphs explicitly bound state parameter evolution in quantum circuits. In this thesis, an upper bound on entanglement entropy evolution in Clifford circuits is presented. Another important property of quantum systems is magic, which quantifies the difficulty of simulating a quantum state. Magic and entanglement play complementary roles when describing emergent phenomena in AdS/CFT. This work describes the interplay of entanglement and magic, offering holographic consequences for magic as cosmic brane back-reaction.

quant-ph↗

arXiv2024

Gravitational back-reaction is magical

We study the interplay between magic and entanglement in quantum many-body systems. We show that non-local magic, which is supported by the quantum correlations is lower bounded by the non-flatness of entanglement spectrum and upper bounded by the amount of entanglement in the system. We then argue that a smoothed version of non-local magic bounds the hardness of classical simulations for incompressible states. In conformal field theories, we conjecture that the non-local magic should scale linearly with entanglement entropy but sublinearly when an approximation of the state is allowed. We support the conjectures using both analytical arguments based on unitary distillation and numerical data from an Ising CFT. If the CFT has a holographic dual, then we prove that the non-local magic vanishes if and only if there is no gravitational back-reaction. Furthermore, we show that non-local magic is approximately equal to the rate of change of the minimal surface area in response to the change of cosmic brane tension in the bulk.

hep-th↗

arXiv2023

Entropy Cones and Entanglement Evolution for Dicke States

The $N$-qubit Dicke states $|D^N_k\rangle$, of Hamming-weight $k$, are a class of entangled states which play an important role in quantum algorithm optimization. We present a general calculation of entanglement entropy in Dicke states, which we use to describe the $|D^N_k\rangle$ entropy cone. We demonstrate that all $|D^N_k\rangle$ entropy vectors emerge symmetrized, and use this to define a min-cut protocol on star graphs which realizes $|D^N_k\rangle$ entropy vectors. We identify the stabilizer group for all $|D^N_k\rangle$, under the action of the $N$-qubit Pauli group and two-qubit Clifford group, which we use to construct $|D^N_k\rangle$ reachability graphs. We use these reachability graphs to analyze and bound the evolution of $|D^N_k\rangle$ entropy vectors in Clifford circuits.

quant-ph↗

arXiv2023

Clifford Orbits from Cayley Graph Quotients

We describe the structure of the $n$-qubit Clifford group $C_n$ via Cayley graphs, whose vertices represent group elements and edges represent generators. In order to obtain the action of Clifford gates on a given quantum state, we introduce a quotient procedure. Quotienting the Cayley graph by the stabilizer subgroup of a state gives a reduced graph which depicts the state's Clifford orbit. Using this protocol for $C_2$, we reproduce and generalize the reachability graphs introduced in arXiv:2204.07593. Since the procedure is state-independent, we extend our study to non-stabilizer states, including the W and Dicke states. Our new construction provides a more precise understanding of state evolution under Clifford circuit action.

quant-ph↗

arXiv2022

An Entropic Lens on Stabilizer States

The $n$-qubit stabilizer states are those left invariant by a $2^n$-element subset of the Pauli group. The Clifford group is the group of unitaries which take stabilizer states to stabilizer states; a physically--motivated generating set, the Hadamard, phase, and CNOT gates which comprise the Clifford gates, imposes a graph structure on the set of stabilizers. We explicitly construct these structures, the "reachability graphs," at $n\le5$. When we consider only a subset of the Clifford gates, the reachability graphs separate into multiple, often complicated, connected components. Seeking an understanding of the entropic structure of the stabilizer states, which is ultimately built up by CNOT gate applications on two qubits, we are motivated to consider the restricted subgraphs built from the Hadamard and CNOT gates acting on only two of the $n$ qubits. We show how the two subgraphs already present at two qubits are embedded into more complicated subgraphs at three and four qubits. We argue that no additional types of subgraph appear beyond four qubits, but that the entropic structures within the subgraphs can grow progressively more complicated as the qubit number increases. Starting at four qubits, some of the stabilizer states have entropy vectors which are not allowed by holographic entropy inequalities. We comment on the nature of the transition between holographic and non-holographic states within the stabilizer reachability graphs.

quant-ph↗

arXiv2021

Four-point correlation modular bootstrap for OPE densities

In this work we apply the lightcone bootstrap to a four-point function of scalars in two-dimensional conformal field theory. We include the entire Virasoro symmetry and consider non-rational theories with a gap in the spectrum from the vacuum and no conserved currents. For those theories, we compute the large dimension limit (h/c>>1) of the OPE spectral decomposition of the Virasoro vacuum. We then propose a kernel ansatz that generalizes the spectral decomposition beyond h/c>>1. Finally, we estimate the corrections to the OPE spectral densities from the inclusion of the lightest operator in the spectrum.

hep-th↗