Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices - Pawel Wocjan; Dominik Janzing; Thomas Beth (CoRR, 2001)

Required sample size for learning sparse Bayesian networks with many variables - Pawel Wocjan; Dominik Janzing; Thomas Beth (CoRR, 2002)

Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity. - Pawel Wocjan; Dominik Janzing; Thomas Beth (Quantum Inf. Comput., 2002)

Universal simulation of Hamiltonians using a finite set of control operations. - Pawel Wocjan; Martin Rötteler; Dominik Janzing; Thomas Beth (Quantum Inf. Comput., 2002)

Computational power of Hamiltonians in quantum computing. - Pawel Wocjan (2003)

On The Computational Power Of Physical Interactions: Bounds On The Number Of Time Steps For Simulating Arbitrary Interaction Graphs. - Dominik Janzing; Pawel Wocjan; Thomas Beth (Int. J. Found. Comput. Sci., 2003)

Two QCMA-complete problems. - Pawel Wocjan; Dominik Janzing; Thomas Beth (Quantum Inf. Comput., 2003)

Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing. - Pawel Wocjan; Dominik Janzing; Thomas Beth (Quantum Inf. Process., 2003)

Characterization of Combinatorially Independent Permutation Separability Criteria. - Pawel Wocjan; Michal Horodecki (Open Syst. Inf. Dyn., 2005)

New construction of mutually unbiased bases in square dimensions. - Pawel Wocjan; Thomas Beth (Quantum Inf. Comput., 2005)

Ergodic Quantum Computing. - Dominik Janzing; Pawel Wocjan (Quantum Inf. Process., 2005)

On independent permutation separability criteria. - Lieven Clarisse; Pawel Wocjan (Quantum Inf. Comput., 2006)

Equivalence of Decoupling Schemes and Orthogonal Arrays. - Martin Rötteler; Pawel Wocjan (IEEE Trans. Inf. Theory, 2006)

Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem. - Andrew M. Childs; Aram W. Harrow; Pawel Wocjan (STACS, 2007)

Mutually unbiased bases and orthogonal decompositions of Lie algebras. - P. Oscar Boykin; Meera Sitharam; Pham Huu Tiep; Pawel Wocjan (Quantum Inf. Comput., 2007)

On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems. - Andrew M. Childs; Pawel Wocjan (Quantum Inf. Comput., 2007)

A Simple PromiseBQP-complete Matrix Problem. - Dominik Janzing; Pawel Wocjan (Theory Comput., 2007)

Measuring 4-local qubit observables could probabilistically solve PSPACE. - Pawel Wocjan; Dominik Janzing; Thomas Decker 002 (Quantum Inf. Comput., 2008)

The Jones polynomial: quantum algorithms and applications in quantum complexity theory. - Pawel Wocjan; Jon Yard (Quantum Inf. Comput., 2008)

Efficient quantum algorithm for identifying hidden polynomials. - Thomas Decker 002; Jan Draisma; Pawel Wocjan (Quantum Inf. Comput., 2009)

Estimating Jones and Homfly polynomials with one clean qubit. - Stephen P. Jordan; Pawel Wocjan (Quantum Inf. Comput., 2009)

Fast amplification of QMA. - Daniel Nagaj; Pawel Wocjan; Yong Zhang (Quantum Inf. Comput., 2009)

Efficient circuits for quantum walks. - Chen-Fu Chiang; Daniel Nagaj; Pawel Wocjan (Quantum Inf. Comput., 2010)

A promiseBQP-complete string rewriting problem. - Dominik Janzing; Pawel Wocjan (Quantum Inf. Comput., 2010)

Quantum algorithm for preparing thermal Gibbs states - detailed analysis. - Chen-Fu Chiang; Pawel Wocjan (Quantum Cryptography and Computing, 2010)

Efficient Computation of the Permanent of Block Factorizable Matrices - Kristan Temme; Pawel Wocjan (CoRR, 2012)

New spectral bounds on the chromatic number combining eigenvalues of the Laplacian and signless Laplacian - Clive Elphick; Pawel Wocjan (CoRR, 2012)

New Spectral Bounds on the Chromatic Number Encompassing all Eigenvalues of the Adjacency Matrix. - Pawel Wocjan; Clive Elphick (Electron. J. Comb., 2013)

Strengthening Turan's Theorem for Irregular Graphs - Clive Elphick; Pawel Wocjan (CoRR, 2013)

Hidden Symmetry Subgroup Problems. - Thomas Decker 002; Gábor Ivanyos; Miklos Santha; Pawel Wocjan (SIAM J. Comput., 2013)

New measures of graph irregularity. - Clive Elphick; Pawel Wocjan (Electron. J. Graph Theory Appl., 2014)

On the probability of generating a lattice. - Felix Fontein; Pawel Wocjan (J. Symb. Comput., 2014)

Quantum algorithms for one-dimensional infrastructures. - Pradeep Kiran Sarvepalli; Pawel Wocjan (Quantum Inf. Comput., 2014)

Unified spectral bounds on the chromatic number. - Clive Elphick; Pawel Wocjan (Discuss. Math. Graph Theory, 2015)

Errata: New measures of graph irregularity. - Clive Elphick; Pawel Wocjan (Electron. J. Graph Theory Appl., 2015)

Conjectured bounds for the sum of squares of positive eigenvalues of a graph. - Clive Elphick; Miriam Farber; Felix Goldberg; Pawel Wocjan (Discret. Math., 2016)

Improved Bounded-Strength Decoupling Schemes for Local Hamiltonians. - Adam D. Bookatz; Martin Roetteler; Pawel Wocjan (IEEE Trans. Inf. Theory, 2016)

An Inertial Lower Bound for the Chromatic Number of a Graph. - Clive Elphick; Pawel Wocjan (Electron. J. Comb., 2017)

Supervised Max Hashing for Similarity Image Retrieval. - Ali Al Kobaisi; Pawel Wocjan (ICMLA, 2018)

Does Universal Controllability of Physical Systems Prohibit Thermodynamic Cycles? - Dominik Janzing; Pawel Wocjan (Open Syst. Inf. Dyn., 2018)

Spectral Lower Bounds for the Orthogonal and Projective Ranks of a Graph. - Pawel Wocjan; Clive Elphick (Electron. J. Comb., 2019)

Carving-width and contraction trees for tensor networks. - Jonathan Jakes-Schauer; David Anekstein; Pawel Wocjan (CoRR, 2019)

Spectral lower bounds for the quantum chromatic number of a graph. - Clive Elphick; Pawel Wocjan (J. Comb. Theory A, 2019)

Spectral Lower Bounds for the Quantum Chromatic Number of a Graph - Part II. - Pawel Wocjan; Clive Elphick; Parisa Darbari (Electron. J. Comb., 2020)

Szegedy Walk Unitaries for Quantum Maps. - Pawel Wocjan; Kristan Temme (CoRR, 2021)

Accuracy analysis of Educational Data Mining using Feature Selection Algorithm. - Ali Almalki; Pawel Wocjan (CoRR, 2021)

On the complexity of quantum partition functions. - Sergey Bravyi 001; Anirban Chowdhury; David Gosset; Pawel Wocjan (CoRR, 2021)

Space-efficient Quantization Method for Reversible Markov Chains. - Chen-Fu Chiang; Anirban Chowdhury; Pawel Wocjan (CoRR, 2022)

Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions. - Srinivasan Arunachalam; Vojtech Havlícek; Giacomo Nannicini; Kristan Temme; Pawel Wocjan (Quantum, 2022)

More tales of Hoffman: bounds for the vector chromatic number of a graph. - Pawel Wocjan; Clive Elphick; David Anekstein (Discuss. Math. Graph Theory, 2023)

Quantum-enhanced Markov chain Monte Carlo. - David Layden; Guglielmo Mazzola; Ryan V. Mishmash; Mario Motta; Pawel Wocjan; Jin-Sung Kim; Sarah Sheldon (Nat., 2023)

Thermal State Preparation via Rounding Promises. - Patrick Rall; Chunhao Wang; Pawel Wocjan (Quantum, 2023)

Techniques for learning sparse Pauli-Lindblad noise models. - Ewout van den Berg; Pawel Wocjan (Quantum, 2024)