6 citations · 6 across the 1 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2021
Efficient, stabilized two-qubit gates on a trapped-ion quantum computer
Reinhold Blümel, Nikodem Grzesiak, Nhung H. Nguyen +5
Quantum computing is currently limited by the cost of two-qubit entangling operations. In order to scale up quantum processors and achieve a quantum advantage, it is crucial to eco…
quant-ph2019
Efficient Arbitrary Simultaneously Entangling Gates on a trapped-ion quantum computer
Nikodem Grzesiak, Reinhold Blümel, Kristin Beck +7
Efficiently entangling pairs of qubits is essential to fully harness the power of quantum computing. Here, we devise an exact protocol that simultaneously entangles arbitrary pairs…
quant-ph2003
Solution of scaling quantum networks
Yu. Dabaghian, R. Blümel
We show that all scaling quantum graphs are explicitly integrable, i.e. any one of their spectral eigenvalues is computable analytically, explicitly, and individually for any…