Related papers: Graph-State Circuit Blocks control Entanglement an…
We investigate the quantum dynamics of a one-dimensional quasiperiodic system featuring a single-particle mobility edge (SPME), described by the generalized Aubry-Andr\'e (GAA) model. This model offers a unique platform to study the…
In this work, we study the complexity of graph-state preparation. We consider general quantum algorithms consisting of Clifford operations acting on at most two qubits for graph-state preparations. We define the CZ-complexity of a graph…
It has recently been discovered that random quantum circuits provide an avenue to realize rich entanglement phase diagrams, which are hidden to standard expectation values of operators. Here we study (2+1)D random circuits with random…
Floquet quantum circuits are able to realise a wide range of non-equilibrium quantum states, exhibiting quantum chaos, topological order and localisation. In this work, we investigate the stability of operator localisation and emergence of…
Quantum networks are promising venues for quantum information processing. This motivates the study of the entanglement properties of the particular multipartite quantum states that underpin these structures. In particular, it has been…
Multi-qubit graph states generated by the action of controlled phase shift operators on a separable quantum state of a system, in which all the qubits are in arbitrary identical states, are examined. The geometric measure of entanglement of…
Graph states are ubiquitous in quantum information with diverse applications ranging from quantum network protocols to measurement based quantum computing. Here we consider the question whether one graph (source) state can be transformed…
The compression of quantum circuits is a foundational challenge for near-term quantum computing, yet the principles governing circuit stability remain poorly understood. We investigate this problem through a large-scale numerical analysis…
We explore the flow of quantum correlations in cluster states defined on ladder type graphs as measurements are done on qubits located on the nodes of the cluster. We focus on three qubits at the end of the ladder and compute the…
Entanglement is one of the physical properties of quantum systems responsible for the computational hardness of simulating quantum systems. But while the runtime of specific algorithms, notably tensor network algorithms, explicitly depends…
In this paper we propose a technique for distributing entanglement in architectures in which interactions between pairs of qubits are constrained to a fixed network $G$. This allows for two-qubit operations to be performed between qubits…
Measurement-induced phase transitions arise due to a competition between the scrambling of quantum information in a many-body system and local measurements. In this work we investigate these transitions in different classes of fast…
We investigate multipartite entanglement dynamics in disordered spin-1/2 lattice models exhibiting a transition from integrability to quantum chaos. Borrowing from the recently introduced generalized entanglement framework, we construct…
We explore the dynamical phases of unitary Clifford circuits with variable-range interactions, coupled to a monitoring environment. We investigate two classes of models, distinguished by the action of the unitary gates, which either are…
Hypergraph states are multi-qubit states that form a subset of the locally maximally entangleable states and a generalization of the well--established notion of graph states. Mathematically, they can conveniently be described by a…
The study of information scrambling in many-body systems has sharpened our understanding of quantum chaos, complexity and gravity. Here, we extend the framework for exploring information scrambling to infinite dimensional continuous…
Graph embedding is a recurrent problem in quantum computing, for instance, quantum annealers need to solve a minor graph embedding in order to map a given Quadratic Unconstrained Binary Optimization (QUBO) problem onto their internal…
We investigate the emergence of quantum chaos and unitary T-design behavior in derandomized Clifford+T circuits using causal cover architectures. Motivated by the need for deterministic constructions that can exhibit chaotic behavior across…
Stabilizer states along with Clifford manipulations (unitary transformations and measurements) thereof -- despite being efficiently simulable on a classical computer -- are an important tool in quantum information processing, with…
We propose generalizations of a number of standard network models, including the classic random graph, the configuration model, and the stochastic block model, to the case of time-varying networks. We assume that the presence and absence of…