◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

T. Decker

18 papers hereh-index 12334 citations43 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author8
  • middle author6
  • last author3

Across the 18 of 18 papers where every author was matched, so the position is known.

fields
  • quant-ph17
  • cs.LG1
same name
  • T. Decker — 3 papers, h 1
  • T. Decker — 3 papers, h 13
  • T. Decker — 2 papers, h 2
  • T. Decker — 1 paper, h 1
  • T. Decker — 1 paper, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20022023
most citedImplementation of group-covariant POVMs by orthogonal measurements

21 citations · 83 across the 18 of their papers we have counts for

collaborators
Showing 2007Show all

4 papers · 1 filter

quant-ph2007

How much is a quantum controller controlled by the controlled system?

Dominik Janzing, Thomas Decker

We consider unitary transformations on a bipartite system A x B. To what extent entails the ability to transmit information from A to B the ability to transfer information in the c…

quant-ph2007★ 10 cited

The Optimal Single Copy Measurement for the Hidden Subgroup Problem

Dave Bacon, Thomas Decker

The optimization of measurements for the state distinction problem has recently been applied to the theory of quantum algorithms with considerable successes, including efficient ne…

quant-ph2007★ 4 cited

Efficient Quantum Algorithm for Identifying Hidden Polynomials

Thomas Decker, Jan Draisma, Pawel Wocjan

We consider a natural generalization of an abelian Hidden Subgroup Problem where the subgroups and their cosets correspond to graphs of linear functions over a finite field F with…

quant-ph2007★ 4 cited

Efficient Quantum Algorithm for Hidden Quadratic and Cubic Polynomial Function Graphs

Thomas Decker, Pawel Wocjan

We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.