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.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Continuous-Variable Quantum State Designs: Theory and Applications
We generalize the notion of quantum state designs to infinite-dimensional spaces. We first prove that, under the definition of continuous-variable (CV) state t-designs from [Blume-Kohout et al., Commun.Math. Phys. 326, 755 (2014)], no state designs exist for t ≥ 2. Similarly, we prove that no CV unitary t-designs exist for t ≥ 2. We propose an alternative definition for CV state designs, which we call rigged t-designs, and provide explicit constructions for t ¼ 2. As an application of rigged designs, we develop a design-based shadow-tomography protocol for CV states. Using energy-constrained versions of rigged designs, we define an average fidelity for CV quantum channels and relate this fidelity to the CV entanglement fidelity. As an additional result of independent interest, we establish a connection between torus 2-designs and complete sets of mutually unbiased bases.  more » « less
Award ID(s):
2120757
PAR ID:
10505836
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
American Physical Society
Date Published:
Journal Name:
Physical Review X
Volume:
14
Issue:
1
ISSN:
2160-3308
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; (, Quantum)
    Toric t -designs, or equivalently t -designs on the diagonal subgroup of the unitary group, are sets of points on the torus over which sums reproduce integrals of degree t monomials over the full torus. Motivated by the projective structure of quantum mechanics, we develop the notion of t -designs on the projective torus, which have a much more restricted structure than their counterparts on full tori. We provide various new constructions of toric and projective toric designs and prove bounds on their size. We draw connections between projective toric designs and a diverse set of mathematical objects, including difference and Sidon sets from the field of additive combinatorics, symmetric, informationally complete positive operator valued measures and complete sets of mutually unbiased bases (MUBs) from quantum information theory, and crystal ball sequences of certain root lattices. Using these connections, we prove bounds on the maximal size of dense B t mod m sets. We also use projective toric designs to construct families of quantum state designs. In particular, we construct families of (uniformly-weighted) quantum state 2 -designs in dimension d of size exactly d ( d + 1 ) that do not form complete sets of MUBs, thereby disproving a conjecture concerning the relationship between designs and MUBs (Zhu 2015). We then propose a modification of Zhu's conjecture and discuss potential paths towards proving this conjecture. We prove a fundamental distinction between complete sets of MUBs in prime-power dimensions versus in dimension 6 (and, we conjecture, in all non-prime-power dimensions), the distinction relating to group structure of the corresponding projective toric design. Finally, we discuss many open questions about the properties of these projective toric designs and how they relate to other questions in number theory, geometry, and quantum information. 
    more » « less
  2. ; ; (, Journal of Mathematical Physics)
    We study the Twisted Kitaev Quantum Double model within the framework of Local Topological Order (LTO). We extend its definition to arbitrary 2D lattices, enabling an explicit characterization of the ground state space through the invariant spaces of monomial representations. We reformulate the LTO conditions to include general lattices and prove that the twisted model satisfies all four LTO axioms on any 2D lattice. As a corollary, we show that its ground state space is a quantum error-correcting code. 
    more » « less
  3. ; ; (, STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing)
    The NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastings posits that there exist families of Hamiltonians with all low energy states of non-trivial complexity (with complexity measured by the quantum circuit depth preparing the state). We prove this conjecture by showing that a particular family of constant-rate and linear-distance qLDPC codes correspond to NLTS local Hamiltonians, although we believe this to be true for all current constructions of good qLDPC codes. 
    more » « less
  4. ; ; ; ; ; ; ; ; ; (, Physical review research)
    We propose a set of Bell-type nonlocal games that can be used to prove an unconditional quantum advantage in an objective and hardware-agnostic manner. In these games, the circuit depth needed to prepare a cyclic cluster state and measure a subset of its Pauli stabilizers on a quantum computer is compared to that of classical Boolean circuits with the same, nearest-neighboring gate connectivity. Using a circuit-based trapped-ion quantum computer, we prepare and measure a six-qubit cyclic cluster state with an overall fidelity of 60.6% and 66.4%, before and after correcting for measurement-readout errors, respectively. Our experimental results indicate that while this fidelity readily passes conventional (or depth-0) Bell bounds for local hidden-variable models, it is on the cusp of demonstrating a higher probability of success than what is possible by depth-1 classical circuits. Our games offer a practical and scalable set of quantitative benchmarks for quantum computers in the pre-fault-tolerant regime as the number of qubits available increases. 
    more » « less
  5. ; (, Journal of the ACM)
    Abraham, Dolev, Geffner, and Halpern [ 1 ] proved that, in asynchronous systems, a (k, t)-robust equilibrium for n players and a trusted mediator can be implemented without the mediator as long as n > 4( k+t ), where an equilibrium is ( k, t )-robust if, roughly speaking, no coalition of t players can decrease the payoff of any of the other players, and no coalition of k players can increase their payoff by deviating. We prove that this bound is tight, in the sense that if n ≤ 4( k+t ) there exist ( k, t )-robust equilibria with a mediator that cannot be implemented by the players alone. Even though implementing ( k, t )-robust mediators seems closely related to implementing asynchronous multiparty ( k+t )-secure computation [ 6 ], to the best of our knowledge there is no known straightforward reduction from one problem to another. Nevertheless, we show that there is a non-trivial reduction from a slightly weaker notion of ( k+t )-secure computation, which we call ( k+t )-strict secure computation , to implementing ( k, t )-robust mediators. We prove the desired lower bound by showing that there are functions on n variables that cannot be ( k+t )-strictly securely computed if n ≤ 4( k+t ). This also provides a simple alternative proof for the well-known lower bound of 4 t +1 on asynchronous secure computation in the presence of up to t malicious agents [ 4 , 8 , 10 ]. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email