Pawel Wocjan

Affiliations:
  • University of Central Florida, Orlando, USA


According to our database1, Pawel Wocjan authored at least 52 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Thermal State Preparation via Rounding Promises.
Quantum, October, 2023

Quantum-enhanced Markov chain Monte Carlo.
Nat., 2023

More tales of Hoffman: bounds for the vector chromatic number of a graph.
Discuss. Math. Graph Theory, 2023

2022
Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions.
Quantum, September, 2022

Space-efficient Quantization Method for Reversible Markov Chains.
CoRR, 2022

2021
On the complexity of quantum partition functions.
CoRR, 2021

Accuracy analysis of Educational Data Mining using Feature Selection Algorithm.
CoRR, 2021

Szegedy Walk Unitaries for Quantum Maps.
CoRR, 2021

2020
Spectral Lower Bounds for the Quantum Chromatic Number of a Graph - Part II.
Electron. J. Comb., 2020

2019
Spectral lower bounds for the quantum chromatic number of a graph.
J. Comb. Theory A, 2019

Carving-width and contraction trees for tensor networks.
CoRR, 2019

Spectral Lower Bounds for the Orthogonal and Projective Ranks of a Graph.
Electron. J. Comb., 2019

2018
Does Universal Controllability of Physical Systems Prohibit Thermodynamic Cycles?
Open Syst. Inf. Dyn., 2018

Supervised Max Hashing for Similarity Image Retrieval.
Proceedings of the 17th IEEE International Conference on Machine Learning and Applications, 2018

2017
An Inertial Lower Bound for the Chromatic Number of a Graph.
Electron. J. Comb., 2017

2016
Improved Bounded-Strength Decoupling Schemes for Local Hamiltonians.
IEEE Trans. Inf. Theory, 2016

Conjectured bounds for the sum of squares of positive eigenvalues of a graph.
Discret. Math., 2016

2015
Errata: New measures of graph irregularity.
Electron. J. Graph Theory Appl., 2015

Unified spectral bounds on the chromatic number.
Discuss. Math. Graph Theory, 2015

2014
Quantum algorithms for one-dimensional infrastructures.
Quantum Inf. Comput., 2014

On the probability of generating a lattice.
J. Symb. Comput., 2014

New measures of graph irregularity.
Electron. J. Graph Theory Appl., 2014

2013
Hidden Symmetry Subgroup Problems.
SIAM J. Comput., 2013

Strengthening Turan's Theorem for Irregular Graphs
CoRR, 2013

New Spectral Bounds on the Chromatic Number Encompassing all Eigenvalues of the Adjacency Matrix.
Electron. J. Comb., 2013

2012
New spectral bounds on the chromatic number combining eigenvalues of the Laplacian and signless Laplacian
CoRR, 2012

Efficient Computation of the Permanent of Block Factorizable Matrices
CoRR, 2012

2010
Quantum algorithm for preparing thermal Gibbs states - detailed analysis.
Proceedings of the Quantum Cryptography and Computing, 2010

A promiseBQP-complete string rewriting problem.
Quantum Inf. Comput., 2010

Efficient circuits for quantum walks.
Quantum Inf. Comput., 2010

2009
Fast amplification of QMA.
Quantum Inf. Comput., 2009

Estimating Jones and Homfly polynomials with one clean qubit.
Quantum Inf. Comput., 2009

Efficient quantum algorithm for identifying hidden polynomials.
Quantum Inf. Comput., 2009

2008
The Jones polynomial: quantum algorithms and applications in quantum complexity theory.
Quantum Inf. Comput., 2008

Measuring 4-local qubit observables could probabilistically solve PSPACE.
Quantum Inf. Comput., 2008

2007
A Simple PromiseBQP-complete Matrix Problem.
Theory Comput., 2007

On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems.
Quantum Inf. Comput., 2007

Mutually unbiased bases and orthogonal decompositions of Lie algebras.
Quantum Inf. Comput., 2007

Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem.
Proceedings of the STACS 2007, 2007

2006
Equivalence of Decoupling Schemes and Orthogonal Arrays.
IEEE Trans. Inf. Theory, 2006

On independent permutation separability criteria.
Quantum Inf. Comput., 2006

2005
Ergodic Quantum Computing.
Quantum Inf. Process., 2005

New construction of mutually unbiased bases in square dimensions.
Quantum Inf. Comput., 2005

Characterization of Combinatorially Independent Permutation Separability Criteria.
Open Syst. Inf. Dyn., 2005

2003
Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing.
Quantum Inf. Process., 2003

Two QCMA-complete problems.
Quantum Inf. Comput., 2003

On The Computational Power Of Physical Interactions: Bounds On The Number Of Time Steps For Simulating Arbitrary Interaction Graphs.
Int. J. Found. Comput. Sci., 2003

Computational power of Hamiltonians in quantum computing.
PhD thesis, 2003

2002
Universal simulation of Hamiltonians using a finite set of control operations.
Quantum Inf. Comput., 2002

Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity.
Quantum Inf. Comput., 2002

Required sample size for learning sparse Bayesian networks with many variables
CoRR, 2002

2001
Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices
CoRR, 2001


  Loading...