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

Demonstrating multilevel entanglement and optimal quantum measurements

Adetunmise C. Dada

Published Feb 1, 2013• 0 citations
OpenAlex

Related papers

Quantum secret sharing with multilevel mutually (un)biased bases

I-Ching Yu, Feng-Li Lin, Ching-Yu Huang

We construct general schemes for multipartite quantum secret sharing using multilevel systems, and find that the consistency conditions for valid measurements can be summarized in two simple algebraic conditions. The scheme using very high-dimensional mutually unbiased bases can in principle achieve perfect security against intercept-resend attack; and for the scheme using mutually biased bases, it reaches the optimal but nonperfect security at the four-level system. We also address the security issue against general attacks in the context of our multilevel schemes. In particular, we propose a protocol to enhance both the efficiency and the security against an entanglement-assisted participant's attack by incorporating quantum-key-distribution and measurement-basis-encrypted schemes so that its security is as robust as quantum-key distribution.

arXiv:0711.3111•Physical Review A•Jul 23, 2008•90 citations

Detecting multilevel entanglement from light-based entanglement witnesses

Pedro Rosario, Romain Bachelard

We introduce a set of electric-field based inequalities capable of detecting multilevel entanglement from a system of N quantum emitters. We determine that the polarization channel as well as the direction of detection can enhance entanglement detection, a feature specific to multilevel systems. We demonstrate the efficiency of the witnesses to detect genuine multipartite entanglement by applying it to families of paradigmatic quantum states, such as Dicke states, singlet states and W-like states. The detection is not only robust to noise, but also applies to mixed entangled states. Our findings open up possibilities for the detection of entanglement without local measurements in systems of multilevel emitters such as superconducting qubits, Rydberg atoms or quantum dots.

quant-pharXiv:2602.08180•Physical Review A•Feb 10, 2026•0 citations

Quantumness versus entanglement in quantum measurements

Marco Piani, Gerardo Adesso

•Oct 11, 2011•1 citation

Quantumness versus entanglement in quantum measurements

Gerardo Adesso, Marco Piani

Bulletin of the American Physical Society•Feb 27, 2012•1 citation

Retargetable Optimizing Compilers for Quantum Accelerators via a Multilevel Intermediate Representation

Thien Nguyen, Alexander McCaskey

We present a multilevel quantum–classical intermediate representation (IR) that enables an optimizing, retargetable compiler for available quantum languages. Our work builds upon the multilevel intermediate representation (MLIR) framework and leverages its unique progressive lowering capabilities to map quantum languages to the low-level virtual machine (LLVM) machine-level IR. We provide both quantum and classical optimizations via the MLIR pattern rewriting subsystem and standard LLVM optimization passes, and demonstrate the programmability, compilation, and execution of our approach via standard benchmarks and test cases. In comparison to other standalone language and compiler efforts available today, our work results in compile times that are 1,000× faster than standard Pythonic approaches, and 5–10× faster than comparative standalone quantum language compilers. Our compiler provides quantum resource optimizations via standard programming patterns that result in a 10× reduction in entangling operations, a common source of program noise. We see this work as a vehicle for rapid quantum compiler prototyping.

IEEE Micro•Jun 14, 2022•8 citations

Quantum entanglement : theory and an experiment

Hoshang Heydari

•Jan 1, 2004•0 citations
We construct general schemes for multipartite quantum secret sharing using multilevel systems, and find that the consistency conditions for valid measurements can be summarized in two simple algebraic conditions. The scheme using very high-dimensional mutually unbiased bases can in principle achieve perfect security against intercept-resend attack; and for the scheme using mutually biased bases, it reaches the optimal but nonperfect security at the four-level system. We also address the security issue against general attacks in the context of our multilevel schemes. In particular, we propose a protocol to enhance both the efficiency and the security against an entanglement-assisted participant's attack by incorporating quantum-key-distribution and measurement-basis-encrypted schemes so that its security is as robust as quantum-key distribution.
We introduce a set of electric-field based inequalities capable of detecting multilevel entanglement from a system of N quantum emitters. We determine that the polarization channel as well as the direction of detection can enhance entanglement detection, a feature specific to multilevel systems. We demonstrate the efficiency of the witnesses to detect genuine multipartite entanglement by applying it to families of paradigmatic quantum states, such as Dicke states, singlet states and W-like states. The detection is not only robust to noise, but also applies to mixed entangled states. Our findings open up possibilities for the detection of entanglement without local measurements in systems of multilevel emitters such as superconducting qubits, Rydberg atoms or quantum dots.
We present a multilevel quantum–classical intermediate representation (IR) that enables an optimizing, retargetable compiler for available quantum languages. Our work builds upon the multilevel intermediate representation (MLIR) framework and leverages its unique progressive lowering capabilities to map quantum languages to the low-level virtual machine (LLVM) machine-level IR. We provide both quantum and classical optimizations via the MLIR pattern rewriting subsystem and standard LLVM optimization passes, and demonstrate the programmability, compilation, and execution of our approach via standard benchmarks and test cases. In comparison to other standalone language and compiler efforts available today, our work results in compile times that are 1,000× faster than standard Pythonic approaches, and 5–10× faster than comparative standalone quantum language compilers. Our compiler provides quantum resource optimizations via standard programming patterns that result in a 10× reduction in entangling operations, a common source of program noise. We see this work as a vehicle for rapid quantum compiler prototyping.