Quantum Networkpowered by
searchSubscribe
Quantum Network

News, research, careers and the quantum industry, in one place.

  • alternate_email
  • search

Explore

  • Editorial
  • Research Hub
  • Events
  • Opportunities
  • About Us

Community

  • Join the Community
  • Learning Resources
  • Contact Us

Contact

A-307, Kailash Business Park,
Vikhroli (W), Mumbai – 400079

022 49646504

[email protected]

  • Newsletter
  • India Quantum Pulse
Quantum Networkpowered by
searchSubscribe
RESEARCH·Oct 27, 2026·1 MIN READ

Genuinely multipartite entangled qudits: one rule to link them all

arXiv:2610.33160v1 Announce Type: new Abstract: Links of rings offer an intuitive picture of multipartite entanglement. Cutting one ring can free some of the others, just as losing a particle, i.e. tracing it out, can disentangle some of the remaining ones. This analogy classifies multipartite entanglement according to which groups of particles stay entangled when others are lost, a question at the heart of robust quantum networks. However, pure states realizing a given link class were known...

Source

arXiv

Author: Gon\c{c}alo M. Quinta, Rui Andr\'{e}

Published Oct 27, 2026

Summarised/rewritten with AI from arXiv

Read original articlearrow_forward

arXiv:2610.33160v1 Announce Type: new Abstract: Links of rings offer an intuitive picture of multipartite entanglement. Cutting one ring can free some of the others, just as losing a particle, i.e. tracing it out, can disentangle some of the remaining ones. This analogy classifies multipartite entanglement according to which groups of particles stay entangled when others are lost, a question at the heart of robust quantum networks. However, pure states realizing a given link class were known only in special cases. Here, we close this gap. Recasting link polynomials as hypergraphs, we give an explicit formula for pure qudit states and prove that, for every link class, their entanglement under any pattern of particle loss matches the link exactly. The same construction also controls genuine multipartite entanglement, determining exactly which of the groups that stay entangled are genuinely multipartite entangled, and all of them can be made so. As a consequence, we prove the conjecture that $m$-resistant pure qudit states, which stay entangled after the loss of any $m$ particles but become fully separable after the loss of $m+1$, exist for any number of particles and any $m$.

QUANT-PH

Report a problem / takedown

ABOUT THIS STORY

Source
arXiv
Published
Oct 27, 2026
Category
RESEARCH
Read original articlearrow_forward

More from Quantum Network

RESEARCH

Fully quantum training of parametric circuits with Quantum Hamiltonian Descent

Parametric quantum circuits are usually trained by classical, local optimizers, which use the quantum computer only to evaluate the cost function, or its gradient, one point at a time. Quantum Hamiltonian Descent (QHD) takes a different route: in this quantum algorithm for continuous optimization, the parameters become the position of a quantum particle, with the cost function as its potential, and two time schedules control kinetic and potentia...

Oct 27, 2026

arrow_forward
Direct tests of conformal symmetry with Rydberg atoms: assessment and proposals
RESEARCH

Direct tests of conformal symmetry with Rydberg atoms: assessment and proposals

We propose a direct test of conformal symmetry using Rydberg-atom arrays. By arranging the atoms on a circle and measuring equal-time two-point correlation functions, the characteristic functional form predicted by conformal field theory can be tested directly. We estimate the number of experimental snapshots required to resolve this behavior with sufficient statistical precision. We further optimize the time-dependent ramp profile of the Rabi f...

Oct 27, 2026

arrow_forward
The Cost of a Real Grover Oracle: Minecraft Seed Search from Software to Quantum Hardware
RESEARCH

The Cost of a Real Grover Oracle: Minecraft Seed Search from Software to Quantum Hardware

We present the resource estimation of how known-constant arithmetic changes the cost of a Grover oracle for Minecraft 1.13.1 seed recovery, an application of quantum search to procedural content generation. The oracle developed here combines a structure-placement predicate with a reversible inverse transform of the linear congruential generator for the 32-bit residual search. Reduced-width arithmetic, phase marking, uncomputation, and complete G...

Oct 27, 2026

arrow_forward
The Entire Quantum Computer on a Classical Leash
RESEARCH

The Entire Quantum Computer on a Classical Leash

We show that a classical client with no quantum hardware can use a single untrusted and potentially malicious quantum server as if it were its own trusted quantum computer. Through the server, the client can privately choose and run quantum computations, prepare quantum states, and process quantum states supplied by other parties. It can also keep quantum memory on the server, hidden from the server itself, and use that memory in later computati...

Oct 26, 2026

arrow_forward
Quantum Network

News, research, careers and the quantum industry, in one place.

  • alternate_email
  • search

Explore

  • Editorial
  • Research Hub
  • Events
  • Opportunities
  • About Us

Community

  • Join the Community
  • Learning Resources
  • Contact Us

Contact

A-307, Kailash Business Park,
Vikhroli (W), Mumbai – 400079

022 49646504

[email protected]

  • Newsletter
  • India Quantum Pulse