Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Optics Communications

Design of quantum communication systems using Platonic classifiers

Majid Mobini, Mohammadreza Vali, Hossein Aghababa

Published Jun 4, 2026• 0 citations
Publisher
DOI
10.1016/j.optcom.2026.133446

Related papers

Energy transport and optimal design of noisy Platonic quantum networks

C. Javaherian, Christopher Ferrie

Abstract Optimal energy transport is one of the primary goals for designing efficient quantum networks. In this work, the maximum energy transport is investigated for three-dimensional quantum networks with Platonic geometries affected by dephasing and dissipative Markovian noise. The network and the environmental characteristics corresponding the optimal design are obtained and investigated for five Platonic networks with 4, 6, 8, 12, and 20 number of sites that one of the sites is connected to a sink site through a Markovian dissipative process. Such optimal designs could have various applications like switching and multiplexing in quantum circuits.

arXiv:2208.01212•Physica Scripta•Feb 2, 2023•0 citations

Classification and Construction of Quantum Communication Systems

Bernd Müller

Communications in Mathematical Physics•Jan 1, 1998•0 citations

Platonic dynamical decoupling sequences for interacting spin systems

Colin Read, Eduardo Serrano-Ensástiga, John Martin

In the NISQ era, where quantum information processing is hindered by the decoherence and dissipation of elementary quantum systems, developing new protocols to extend the lifetime of quantum states is of considerable practical and theoretical importance. A well-known technique, known as dynamical decoupling, uses a carefully designed sequence of pulses applied to a quantum system, such as a spin- j (which represents a qudit with d=2j+1 levels), to suppress the coupling Hamiltonian between the system and its environment, thereby mitigating dissipation. While dynamical decoupling of qubit systems has been widely studied, the decoupling of qudit systems has been far less explored and often involves complex sequences and operations. In this work, we design efficient decoupling sequences composed solely of global SU(2) rotations and based on tetrahedral, octahedral, and icosahedral point groups, which we call Platonic sequences. We extend the Majorana representation for Hamiltonians to develop a simple framework that establishes the decoupling properties of each Platonic sequence and show its effectiveness on many examples. These sequences are universal in their ability to cancel any type of interaction with the environment for single spin- j with spin quantum number j⩽5/2 , and they are capable of decoupling up to 5 -body interactions in an ensemble of interacting spin- 1/2 with only global pulses, provided that the interaction Hamiltonian has no isotropic component, with the exception of the global identity. We also discuss their inherent robustness to finite pulse duration and a wide range of pulse errors, as well as their potential application as building blocks for dynamically corrected gates.

arXiv:2409.04974•Quantum•Mar 12, 2025•7 citations

Quantum Communication Networks: Design and Simulation

Riccardo Bassoli, Holger Boche, Christian Deppe +4 more

Foundations in signal processing, communications and networking•Oct 30, 2020•8 citations

Design and Analysis of Quantum Communication Protocols

Chitra Shukla

•Mar 18, 2015•1 citation

Quantum coherent states in platonic constellations for multidimensional photonic communications

César A. López-Mercado, Francisco Javier Mendieta-Jiménez, Arturo Arvizu‐Mondragón +1 more

Quantum Information Processing•Feb 16, 2026•0 citations
Abstract Optimal energy transport is one of the primary goals for designing efficient quantum networks. In this work, the maximum energy transport is investigated for three-dimensional quantum networks with Platonic geometries affected by dephasing and dissipative Markovian noise. The network and the environmental characteristics corresponding the optimal design are obtained and investigated for five Platonic networks with 4, 6, 8, 12, and 20 number of sites that one of the sites is connected to a sink site through a Markovian dissipative process. Such optimal designs could have various applications like switching and multiplexing in quantum circuits.
In the NISQ era, where quantum information processing is hindered by the decoherence and dissipation of elementary quantum systems, developing new protocols to extend the lifetime of quantum states is of considerable practical and theoretical importance. A well-known technique, known as dynamical decoupling, uses a carefully designed sequence of pulses applied to a quantum system, such as a spin- j (which represents a qudit with d=2j+1 levels), to suppress the coupling Hamiltonian between the system and its environment, thereby mitigating dissipation. While dynamical decoupling of qubit systems has been widely studied, the decoupling of qudit systems has been far less explored and often involves complex sequences and operations. In this work, we design efficient decoupling sequences composed solely of global SU(2) rotations and based on tetrahedral, octahedral, and icosahedral point groups, which we call Platonic sequences. We extend the Majorana representation for Hamiltonians to develop a simple framework that establishes the decoupling properties of each Platonic sequence and show its effectiveness on many examples. These sequences are universal in their ability to cancel any type of interaction with the environment for single spin- j with spin quantum number j⩽5/2 , and they are capable of decoupling up to 5 -body interactions in an ensemble of interacting spin- 1/2 with only global pulses, provided that the interaction Hamiltonian has no isotropic component, with the exception of the global identity. We also discuss their inherent robustness to finite pulse duration and a wide range of pulse errors, as well as their potential application as building blocks for dynamically corrected gates.