Thomas Beth
- Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of\n non-abelian Groups
1998/12/23 by Martin Roetteler, Roetteler, Martin, Thomas Beth +1 · 17 citations
Computer Science · #Quantum Computing Algorithms and Architecture #Matrix Theory and Algorithms #Quantum Information and Cryptography
- Two QCMA-complete problems
2003/05/16 by Paweł Wocjan, Pawel Wocjan, Dominik Janzing +4 · 3 citations
Computer Science · Physics and Astronomy · #Cryptography and Data Security #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #quant-ph
- Identity check is QMA-complete
2003/05/09 by Dominik Janzing, Paweł Wocjan, Janzing, Dominik +3 · 2 citations
Computer Science · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata
- New Construction of Mutually Unbiased Bases in Square Dimensions
2004/07/12 by Paweł Wocjan, Pawel Wocjan, Wocjan, Pawel +2 · 2 citations
Computer Science · Engineering · Physics and Astronomy · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Physical sciences #Quantum Physics (quant-ph) #graph theory and CDMA systems #quant-ph
- Cooling and Low Energy State Preparation for 3-local Hamiltonians are FQMA-complete
2003/03/31 by Dominik Janzing, Janzing, Dominik, Pawel Wocjan +4 · 2 citations
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum and electron transport phenomena #Quantum many-body systems #quant-ph