skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Quantum State Combinatorics
This paper concerns the analysis of large quantum states. It is a notoriously difficult problem to quantify separability of quantum states, and for large quantum states, it is unfeasible. Here we posit that when quantum states are large, we can deduce reasonable expectations for the complex structure of non-classical multipartite correlations with surprisingly little information about the state. We show, with pegagogical examples, how known results from combinatorics can be used to reveal the expected structure of various correlations hidden in the ensemble described by a state.  more » « less
Award ID(s):
2211326
PAR ID:
10581822
Author(s) / Creator(s):
Publisher / Repository:
MDPI
Date Published:
Journal Name:
Entropy
Volume:
26
Issue:
9
ISSN:
1099-4300
Page Range / eLocation ID:
764
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Large multipartite quantum systems tend to rapidly reach extraordinary levels of complexity as their number of constituents and entanglement links grow. Here we use complex network theory to study a class of continuous variables quantum states that present both multipartite entanglement and non-Gaussian statistics. In particular, the states are built from an initial imprinted cluster state created via Gaussian entangling operations according to a complex network structure. To go beyond states that can be easily simulated via classical computers we engender non-Gaussian statistics via multiple photon subtraction operations. We then use typical networks measures, the degree and clustering, to characterize the emergent complex network of photon-number correlations after photon subtractions. We show that, in contrast to regular clusters, in the case of imprinted complex network structures the emergent correlations are strongly affected by photon subtraction. On the one hand, we unveil that photon subtraction universally increases the average photon-number correlations, regardless of the imprinted network structure. On the other hand, we show that the shape of the distributions in the emergent networks after subtraction is greatly influenced by the structure of the imprinted network, as witnessed by their higher-moments. Thus for the field of network theory, we introduce a new class of networks to study. At the same time for the field of continuous variable quantum states, this work presents a new set of practical tools to benchmark systems of increasing complexity. 
    more » « less
  2. There has been an increasing interest in exploring quantities associated with quantum information at colliders. We perform a detailed analysis describing how to measure the quantum discord in the top anti-top quantum state at the Large Hadron Collider (LHC). While for pure states, quantum discord, entanglement, and Bell nonlocality all probe the same correlations, for mixed states they probe different aspects of quantum correlations. The quantum discord, in particular, is interesting because it aims to encapsulate all correlations between systems that cannot have a classical origin. We employ two complementary approaches for the study of the top anti-top system, namely the decay method and the kinematic method. We highlight subtleties associated with measuring discord for reconstructed quantum states at colliders. Usually quantum discord is difficult to compute due to an extremization that must be performed. We show, however, that for the$$ t\overline{t} $$ t t ¯ system this extremization can be performed analytically and we provide closed-form formulas for the quantum discord. We demonstrate that with current LHC datasets, quantum discord can be observed at 3.6 – 5.7σ, depending on the signal region, with the decay method and can be measured at a precision of 0.1 – 0.2% with the kinematic method. At the high luminosity LHC, the observation of quantum discord is expected to be > 5σusing both the decay and kinematic methods and can be measured with a precision of 5% with the decay method and 0.05% with the kinematic method. Additionally, we identify the kinematic cuts at the LHC to isolate the$$ t\overline{t} $$ t t ¯ state that is separable but has non-zero discord. By systematically investigating quantum discord for the first time through a detailed collider analysis, this work expands the toolkit for quantum information studies in particle physics and lays the groundwork for deeper insights into the quantum properties in high-energy collisions. 
    more » « less
  3. Abstract Graph states are a broad family of entangled quantum states, each defined by a graph composed of edges representing the correlations between subsystems. Such states constitute versatile resources for quantum computation and quantum-enhanced measurement. Their generation and engineering require a high level of control over entanglement. Here we report on the generation of continuous-variable graph states of atomic spin ensembles, which form the nodes of the graph. We program the entanglement structure encoded in the graph edges by combining global photon-mediated interactions in an optical cavity with local spin rotations. By tuning the entanglement between two subsystems, we either localize correlations within each subsystem or enable Einstein–Podolsky–Rosen steering—a strong form of entanglement that enables the extraction of precise information from one subsystem through measurements on the other. We further engineer a four-mode square graph state, highlighting the flexibility of our approach. Our method is scalable to larger and more complex graphs, laying groundwork for measurement-based quantum computation and advanced protocols in quantum metrology. 
    more » « less
  4. The present work is motivated by the need for robust, large-scale coherent states that can play possible roles as quantum resources. A challenge is that large, complex systems tend to be fragile. However, emergent phenomena in classical systems tend to become more robust with scale. Do these classical systems inspire ways to think about robust quantum networks? This question is studied by characterizing the complex quantum states produced by mapping interactions between a set of qubits from structure in graphs. We focus on maps based on k-regular random graphs where many edges were randomly deleted. We ask how many edge deletions can be tolerated. Surprisingly, it was found that the emergent coherent state characteristic of these graphs was robust to a substantial number of edge deletions. The analysis considers the possible role of the expander property of k-regular random graphs. 
    more » « less
  5. Entanglement is the key resource for measurement-based quantum computing. It is stored in quantum states known as cluster states, which are prepared offline and enable quantum computing by means of purely local measurements. Universal quantum computing requires cluster states that are both large and possess (at least) a two-dimensional topology. Continuous-variable cluster states—based on bosonic modes rather than qubits—have previously been generated on a scale exceeding one million modes, but only in one dimension. Here, we report generation of a large-scale two-dimensional continuous-variable cluster state. Its structure consists of a 5- by 1240-site square lattice that was tailored to our highly scalable time-multiplexed experimental platform. It is compatible with Bosonic error-correcting codes that, with higher squeezing, enable fault-tolerant quantum computation. 
    more » « less