activity
20182023
most citedThirty-six entangled officers of Euler: Quantum solution to a classically impossible problem

58 citations · 160 across the 14 of their papers we have counts for

collaborators
Showing 2021Show all

6 papers · 1 filter

quant-ph2021★ 1 cited

General stabilizer approach for constructing highly entangled graph states

Zahra Raissi, Adam Burchardt, Edwin Barnes

Highly entangled multipartite states such as k-uniform (k-UNI) and absolutely maximally entangled (AME) states serve as critical resources in quantum networking and other quantum i…

quant-ph2021★ 12 cited

Genuinely quantum SudoQ and its cardinality

Jerzy Paczos, Marcin Wierzbiński, Grzegorz Rajchel-Mieldzioć +2

We expand the quantum variant of the popular game Sudoku by introducing the notion of cardinality of a quantum Sudoku (SudoQ), equal to the number of distinct vectors appearing in…

quant-ph2021★ 25 cited

Entanglement in highly symmetric multipartite quantum states

Adam Burchardt, Jakub Czartowski, Karol Życzkowski

We present a construction of genuinely entangled multipartite quantum states based on the group theory. Analyzed states resemble the Dicke states, whereas the interactions occur on…

quant-ph2021

Absolutely entangled sets of pure states for bipartitions and multipartitions

Baichu Yu, Pooja Jayachandran, Adam Burchardt +3

A set of quantum states is said to be absolutely entangled, when at least one state in the set remains entangled for any definition of subsystems, i.e. for any choice of the global…

quant-ph2021★ 2 cited

Entanglement Classification via Single Entanglement Measure

Adam Burchardt, Gonçalo M. Quinta, Rui André

We show that a single polynomial entanglement measure is enough to verify equivalence between generic -qubit states under Stochastic Local Operations with Classical Communicatio…

quant-ph2021★ 58 cited

Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem

Suhail Ahmad Rather, Adam Burchardt, Wojciech Bruzda +3

The negative solution to the famous problem of officers of Euler implies that there are no two orthogonal Latin squares of order six. We show that the problem has a solution,…