4 citations · 4 across the 4 of their papers we have counts for
6 papers
Direct U(2) approximation via repeat-until-success circuits
Vadym Kliuchnikov, Jendrik Brachter, Marcus P. da Silva
We show how to directly and efficiently approximate arbitrary one-qubit unitaries, bypassing the Euler decomposition and the magnitude approximation problem, at the cost of one anc…
On groups with chordal power graph, including a classification in the case of finite simple groups
Jendrik Brachter, Eda Kaja
We prove various properties on the structure of groups whose power graph is chordal. Nilpotent groups with this property have been classified by Manna, Cameron and Mehatari [The El…
Classification of non-solvable groups whose power graph is a cograph
Jendrik Brachter, Eda Kaja
Cameron, Manna and Mehatari investigated the question of which finite groups admit a power graph that is a cograph, also called power-cograph groups (Journal of Algebra 591 (2022))…
A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension
Jendrik Brachter, Pascal Schweitzer
We investigate the relationship between various isomorphism invariants for finite groups. Specifically, we use the Weisfeiler-Leman dimension (WL) to characterize, compare and quan…
A Characterization of Individualization-Refinement Trees
Markus Anders, Jendrik Brachter, Pascal Schweitzer
Individualization-Refinement (IR) algorithms form the standard method and currently the only practical method for symmetry computations of graphs and combinatorial objects in gener…
On the Weisfeiler-Leman Dimension of Finite Groups
Jendrik Brachter, Pascal Schweitzer
In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive comple…