Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Adam D. Bookatz

dblp:155/6461 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Quantum computing and quantum information · 50% Combinatorics and discrete mathematics · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics › combinatorial design
orthogonal arrays
0.212016
Improved Bounded-Strength Decoupling Schemes for Local Hamiltonians · IEEE Trans. Inf. Theory 2016
Quantum computing and quantum information
quantum control
0.212016
Improved Bounded-Strength Decoupling Schemes for Local Hamiltonians · IEEE Trans. Inf. Theory 2016
YearPublicationVenuePosition
2016 Improved Bounded-Strength Decoupling Schemes for Local Hamiltonians
abstract
We address the task of switching off the Hamiltonian of a system by removing all internal and system-environment couplings. We propose dynamical decoupling schemes that use only bounded-strength controls for quantum many-body systems with local system Hamiltonians and local environmental couplings. To do so, we introduce the combinatorial concept of balanced-cycle orthogonal arrays (BOAs) and show how to construct them from classical error-correcting codes. The derived decoupling schemes may be useful as a primitive for more complex schemes, e.g., for Hamiltonian simulation. For the case of n qubits and a two-local Hamiltonian, the length of the resulting decoupling scheme scales as O(n logn), improving over the previously best-known schemes that scaled quadratically with n. More generally, using BOAs constructed from families of Bose-Chaudhuri-Hocquenghem (BCH) codes, we show that bounded-strength decoupling for any ℓ-local Hamiltonian, where ℓ ≥ 2, can be achieved using decoupling schemes of length at most O(nℓ-1log n).
Adam D. Bookatz, Martin Rötteler, Pawel Wocjan
IEEE Trans. Inf. Theory1