pith. sign in

Pawel Wocjan

Identifiers

  • name variant Pawel Wocjan 0.60 · backfill

Papers (63)

  1. Quantum Algorithm for Identifying Hidden Graphs: Spectral Theory and Numerical Evidence quant-ph · 2026 · author #1
  2. A Factorization Identity for Twisted Multinomial Coefficients with Application to Pilot States in Hamiltonian Decoded Quantum Interferometry quant-ph · 2026 · author #1
  3. An inertial upper bound for the quantum independence number of a graph math.CO · 2018 · author #1
  4. Spectral lower bounds for the orthogonal and projective ranks of a graph math.CO · 2018 · author #1
  5. Spectral lower bounds for the quantum chromatic number of a graph math.CO · 2018 · author #1
  6. Conjectured lower bound for the clique number of a graph math.CO · 2018 · author #2
  7. Conjectured bound for the distribution of eigenvalues of a graph math.CO · 2017 · author #1
  8. Does universal controllability of physical systems prohibit thermodynamic cycles? cond-mat.stat-mech · 2017 · author #2
  9. An inertial lower bound for the chromatic number of a graph math.CO · 2016 · author #2
  10. Improved bounded-strength decoupling schemes for local Hamiltonians quant-ph · 2015 · author #3
  11. Bounds and power means for the general Randic index math.CO · 2015 · author #2
  12. Conjectured bounds for the sum of squares of positive eigenvalues of a graph math.CO · 2014 · author #4
  13. Hamiltonian quantum simulation with bounded-strength controls quant-ph · 2013 · author #2
  14. New measures of graph irregularity math.CO · 2013 · author #2
  15. On the Probability of Generating a Lattice math.CO · 2012 · author #2
  16. Unified spectral bounds on the chromatic number math.CO · 2012 · author #2
  17. Recovering the Period in Shor's Algorithm with Gauss' Algorithm for Lattice Basis Reduction quant-ph · 2012 · author #2
  18. Testing quantum expanders is co-QMA-complete quant-ph · 2012 · author #4
  19. New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix math.CO · 2012 · author #1
  20. Efficient Computation of the Permanent of Block Factorizable Matrices cs.DM · 2012 · author #2
  21. Quantum Algorithm for Computing the Period Lattice of an Infrastructure quant-ph · 2011 · author #2
  22. Hidden Symmetry Subgroup Problems quant-ph · 2011 · author #4
  23. Quantum Algorithms for One-Dimensional Infrastructures quant-ph · 2011 · author #2
  24. Quantum Algorithm for Preparing Thermal Gibbs States - Detailed Analysis physics.comp-ph · 2010 · author #2
  25. Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer quant-ph · 2009 · author #2
  26. Efficient quantum circuits for arbitrary sparse unitaries quant-ph · 2009 · author #2
  27. Fast Amplification of QMA quant-ph · 2009 · author #2
  28. Efficient Circuits for Quantum Walks quant-ph · 2009 · author #3
  29. Quantum Speed-up for Approximating Partition Functions quant-ph · 2008 · author #1
  30. Preparing ground states of quantum many-body systems on a quantum computer quant-ph · 2008 · author #2
  31. Estimating Jones and HOMFLY polynomials with One Clean Qubit quant-ph · 2008 · author #2
  32. Speed-up via Quantum Sampling quant-ph · 2008 · author #1
  33. Hamiltonian Quantum Cellular Automata in 1D quant-ph · 2008 · author #2
  34. A single-shot measurement of the energy of product states in a translation invariant spin chain can replace any quantum computation quant-ph · 2007 · author #2
  35. Efficient Quantum Algorithm for Identifying Hidden Polynomials quant-ph · 2007 · author #3
  36. A PromiseBQP-complete String Rewriting Problem quant-ph · 2007 · author #2
  37. Efficient Quantum Algorithm for Hidden Quadratic and Cubic Polynomial Function Graphs quant-ph · 2007 · author #2
  38. BQP-complete Problems Concerning Mixing Properties of Classical Random Walks on Sparse Graphs quant-ph · 2006 · author #2
  39. Weak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem quant-ph · 2006 · author #3
  40. Estimating diagonal entries of powers of sparse symmetric matrices is BQP-complete quant-ph · 2006 · author #2
  41. Several natural BQP-Complete problems quant-ph · 2006 · author #1
  42. The Jones polynomial: quantum algorithms and applications in quantum complexity theory quant-ph · 2006 · author #1
  43. On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems quant-ph · 2005 · author #2
  44. Mutually Unbiased Bases and Orthogonal Decompositions of Lie Algebras quant-ph · 2005 · author #4
  45. On independent permutation separability criteria quant-ph · 2005 · author #2
  46. Characterization of combinatorially independent permutation separability criteria quant-ph · 2005 · author #1
  47. Real Mutually Unbiased Bases quant-ph · 2005 · author #4
  48. The limitations of nice mutually unbiased bases quant-ph · 2004 · author #3
  49. Efficient decoupling schemes with bounded controls based on Eulerian orthogonal arrays quant-ph · 2004 · author #1
  50. New Construction of Mutually Unbiased Bases in Square Dimensions quant-ph · 2004 · author #1
  51. Ergodic quantum computing quant-ph · 2004 · author #2
  52. Estimating mixing properties of local Hamiltonian dynamics and continuous quantum random walks is PSPACE-hard quant-ph · 2004 · author #1
  53. Measuring 4-local n-qubit observables could probabilistically solve PSPACE quant-ph · 2003 · author #1
  54. Two QCMA-complete problems quant-ph · 2003 · author #1
  55. Identity check is QMA-complete quant-ph · 2003 · author #2
  56. Cooling and Low Energy State Preparation for 3-local Hamiltonians are FQMA-complete quant-ph · 2003 · author #2
  57. Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing quant-ph · 2003 · author #1
  58. The 2-local Hamiltonian problem encompasses NP quant-ph · 2003 · author #1
  59. Required sample size for learning sparse Bayesian networks with many variables cs.LG · 2002 · author #1
  60. Bounds on the number of time steps for simulating arbitrary interaction graphs quant-ph · 2002 · author #2
  61. Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices cs.DM · 2001 · author #1
  62. Complexity of decoupling and time-reversal for n spins with pair-interactions: Arrow of time in quantum control quant-ph · 2001 · author #2
  63. The thermodynamic cost of reliability and low temperatures: Tightening Landauer's principle and the Second Law quant-ph · 2000 · author #2

Mentions

  • 1305.3570 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 1211.6246 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 1210.7844 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 1210.3003 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 1210.0787 #4 · backfill · confidence 0.70 Pawel Wocjan
  • 1209.3190 #1 · backfill · confidence 0.70 Pawel Wocjan
  • 1208.6589 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 1111.1348 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 1107.2189 #4 · backfill · confidence 0.70 Pawel Wocjan
  • 1106.6347 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 1001.1130 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 0905.2199 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 0904.2211 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 0904.1549 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 0903.3465 #3 · backfill · confidence 0.70 Pawel Wocjan
  • 0811.0596 #1 · backfill · confidence 0.70 Pawel Wocjan
  • 0809.2705 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 0807.4688 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 0804.4259 #1 · backfill · confidence 0.70 Pawel Wocjan
  • 0802.0886 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 0710.1615 #2 · backfill · confidence 0.70 Pawel Wocjan
  • 0706.1219 #3 · backfill · confidence 0.70 Pawel Wocjan
  • 0705.1180 #2 · backfill · confidence 0.70 Pawel Wocjan

Frequent Coauthors