The Jones Polynomial: Quantum Algorithms and Applications in Quantum Complexity Theory
Pawel Wocjan and Jon Yard
preprint version arXiv.org quant-ph/0603069
to appear in Quantum Information and Computation
On the Quantum Hardness of Solving Isomorphism Problems as Nonabelian Hidden Shift Problems
Andrew M. Childs and Pawel Wocjan
Quantum Information and Computation, Vol. 7, No. 5&6, pp. 371-382, 2007
preprint version arXiv.org quant-ph/0510185
Mutually Unbiased Bases and Orthogonal Decompositions of Lie Algebras
P. Oscar Boykin, Meera Sitharam, Pham Huu Tiep, and Pawel Wocjan
Quantum Information and Computation, Vol. 7, No. 4, pp. 371-382, 2007
preprint version arXiv.org quant-ph/0506089
Equivalence of Decoupling Schemes and Orthogonal Arrays
M. Roetteler and P. Wocjan
IEEE Transations on Information Theory, Vol. 26, No. 3, September 2006
preprint version arXiv.org quant-ph/0409135
Efficient Decoupling Schemes with Bounded Controls Based on Eulerian
Orthogonal Arrays
P. Wocjan
Physical
Review A 73,062317 (2006)
also published in
Virtual Journal of Quantum
Information and
Virtual Journal of Nanoscale Science & Technology
preprint version arXiv.org quant-ph/0410107
The Limitations of Nice Mutually Unbiased Bases
M. Aschbacher, A. M. Childs, P. Wocjan
Journal
of Algebraic Combinatorics, Issue: Oneline First
preprint version arXiv.org quant-ph/0412066
Further Results on Independent Permutation Separability Criteria
L. Clarisse and P. Wocjan
Quantum Information & Computation, Vol. 6, No. 3, pp. 277 (2006)
preprint version arXiv.org quant-ph/0504160
Characterization of Combinatorically Independent Permutation
Separability Criteria
P. Wocjan and M. Horodecki
preprint version arXiv.org quant-ph/0503129
Open Systems and Information Dynamics, Vol. 12, No. 4, pp. 331, 2005
Non-Identity Check is QMA-Complete
D. Janzing, P. Wocjan, and Th. Beth
International Journal of Quantum Information Vol. 3, No. 3,
pp. 463-473, 2005
preprint version arXiv.org quant-ph/0305050
Ergodic Quantum Computing
D. Janzing and P. Wocjan
Quantum Information Processing, Vol. 2, No. 2, pp. 129-158, 2005.
preprint version arXiv.org quant-ph/0406235
New Construction of Mutually Unbiased Bases in Square Dimensions
P. Wocjan and Th. Beth
Quantum Information & Computation, vol. 5, no. 2, pp. 93-101,
2005
preprint version arXiv.org quant-ph/0407081
Two QCMA-complete problems
P. Wocjan, D. Janzing, and Th. Beth
Quantum Information and Computation, vol. 3, no. 6, pp. 635-643, 2003
preprint version arXiv.org quant-ph/0305090
The 2-local Hamiltonian Problem Encompasses NP
P. Wocjan and Th. Beth
International Journal of Quantum Information, vol. 1, no. 3, pp. 349-357,
2003
preprint version arXiv.org quant-ph/0301087
Treating the Independent Set Problem by 2D Ising Interactions with
Adiabatic Quantum Computing
P. Wocjan, D. Janzing, and Th. Beth
Quantum Information Processing, vol. 2, no. 4, pp. 259-270, 2003
preprint version arXiv.org quant-ph/0302027
On the Computational Power of Physical Interactions: Bounds on the Number
of Time Steps for Simulating Arbitrary Interaction Graphs
D. Janzing, P. Wocjan, and Th. Beth
International Journal of Foundations of Computer Science
vol. 14, no. 5, pp. 889-903, Special Issue Quantum Computing, 2003
preprint version arXiv.org quant-ph/0203061
Simulating Arbitrary Pair-Interactions by a Given Hamiltonian:
Graph-Theoretical Bounds on the Time Complexity
P. Wocjan, D. Janzing, and Th. Beth
Quantum Information & Computation, vol. 2, no. 2, pp. 117-132,
2002
preprint version arXiv.org quant-ph/0106077
Universal Simulation of Hamiltonians Using a Finite Set of
Control Operations
P. Wocjan, M. Roetteler, D. Janzing, and Th. Beth
Quantum Information & Computation, vol. 2, no. 2, pp. 133-150,
2002
preprint version arXiv.org quant-ph/0109063
Simulating Hamiltonians in Quantum Networks: Efficient Schemes and
Complexity Bounds
P. Wocjan, M. Roetteler, D. Janzing, and Th. Beth
Phys. Rev. A, vol. 65, pp. 042309/1-10, 2002
selected for the
April 8, 2002 issue of the Virtual Journal of
Nanoscale Science & Technology
selected for the
April 2002 issue of the
Virtual Journal of Quantum Information
preprint version arXiv.org quant-ph/0109088
Complexity of Decoupling and Time-Reversal for n Spins with
Pair-Interactions: Arrow of Time in Quantum Control
D. Janzing, P. Wocjan, and Th. Beth
Phys. Rev. A, vol. 66, pp. 042311/1-4, 2002
selected for the
October 28, 2002 issue of the
Virtual Journal of Nanoscale Science & Technology
selected for the
November 2002 issue of the
Virtual Journal of Quantum Information
preprint version arXiv.org quant-ph/0106085
Thermodynamic Cost of Reliability and Low Temperatures:
Tightening Landauer's Principle and the Second Law
D. Janzing, P. Wocjan, R. Zeier, R. Geiss, and Th. Beth
International Journal of Theoretical Physics, vol. 39, no. 12,
pp. 2217-2753, 2000
preprint version arXiv.org quant-ph/0002048
Performances of Binary Block Codes Used on
Classical-Quantum Channels
P. Wocjan, D. E. Lazic, and Th. Beth
Proceedings of the
Fifth International Conference on
Quantum Communication, Measurement & Computing, Capri, Italy, 2000,
pp. 43-46
preprint version arXiv.org quant-ph/0007051
A PromiseBQP-complete String Rewriting Problem
Dominik Janzing and Pawel Wocjan
arXiv:0705.1180
Efficient Quantum Algorithm for Hidden Quadratic and Cubic Polynomial Function Graphs
Thomas Decker and Pawel Wocjan
arxiv.org/abs/quant-ph/0703195
BQP-complete Problems Concerning Mixing Properties of Classical Random Walks on Sparse Graphs
Dominik Janzing and Pawel Wocjan
arXiv.org quant-ph/0610235
Several Natural BQP-Complete Problems
Pawel Wocjan and Shengyu Zhang
arXiv.org quant-ph/quant-ph/0606179
On the Maximal Number of Real Mutually Unbiased Bases
P. Oscar Boykin, M. Sitharam, M. Tarifi, and P. Wocjan
arXiv.org quant-ph/0502024
Measuring 4-local n-Qubit Observables Could Probabilistically Solve
PSPACE
P. Wocjan, D. Janzing, Th. Decker, and Th. Beth
arXiv.org quant-ph/0308011
submitted to Journal of Computer and System Science
Cooling and Low Energy State Preparation for 3-local
Hamiltonians are FQMA-complete
D. Janzing, P. Wocjan, and Th. Beth
arXiv.org quant-ph/0303186
Estimating Mixing Properties of Local Hamiltonian Dynamics and
Continuous Quantum Random Walks is PSPACE-Hard
P. Wocjan
arXiv.org quant-ph/0401184
submitted to
Quantum Information & Computation
Required Sample Size for Learning Sparse Bayesian Networks with Many
Variables
P. Wocjan, D. Janzing, and Th. Beth
arXiv.org cs.LG/0204052
Lower Bound on the Chromatic Number by Spectra of
Weighted Adjacency Matrices
P. Wocjan, D. Janzing, and Th. Beth
arXiv.org cs.DM/0112023, 2001