default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPawel Wocjan
Person information
- affiliation: University of Central Florida, Orlando, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j38]Pawel Wocjan, Clive Elphick, David Anekstein:
More tales of Hoffman: bounds for the vector chromatic number of a graph. Discuss. Math. Graph Theory 43(1): 159-169 (2023)- [j37]David Layden
, Guglielmo Mazzola, Ryan V. Mishmash, Mario Motta, Pawel Wocjan, Jin-Sung Kim, Sarah Sheldon:
Quantum-enhanced Markov chain Monte Carlo. Nat. 619(7969): 282-287 (2023) - [j36]Patrick Rall, Chunhao Wang, Pawel Wocjan:
Thermal State Preparation via Rounding Promises. Quantum 7: 1132 (2023) - 2022
- [j35]Srinivasan Arunachalam, Vojtech Havlícek, Giacomo Nannicini, Kristan Temme, Pawel Wocjan:
Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions. Quantum 6: 789 (2022) - [i13]David Layden, Guglielmo Mazzola, Ryan V. Mishmash, Mario Motta, Pawel Wocjan, Jin-Sung Kim, Sarah Sheldon:
Quantum-enhanced Markov chain Monte Carlo. CoRR abs/2203.12497 (2022) - [i12]Chen-Fu Chiang, Anirban Chowdhury, Pawel Wocjan:
Space-efficient Quantization Method for Reversible Markov Chains. CoRR abs/2206.06886 (2022) - 2021
- [c3]Srinivasan Arunachalam, Vojtech Havlícek, Giacomo Nannicini, Kristan Temme, Pawel Wocjan:
Simpler (Classical) and Faster (Quantum) Algorithms for Gibbs Partition Functions. QCE 2021: 112-122 - [i11]Pawel Wocjan, Kristan Temme:
Szegedy Walk Unitaries for Quantum Maps. CoRR abs/2107.07365 (2021) - [i10]Ali Almalki, Pawel Wocjan:
Accuracy analysis of Educational Data Mining using Feature Selection Algorithm. CoRR abs/2107.10669 (2021) - [i9]Sergey Bravyi, Anirban Chowdhury, David Gosset, Pawel Wocjan:
On the complexity of quantum partition functions. CoRR abs/2110.15466 (2021) - 2020
- [j34]Pawel Wocjan, Clive Elphick, Parisa Darbari:
Spectral Lower Bounds for the Quantum Chromatic Number of a Graph - Part II. Electron. J. Comb. 27(4): 4 (2020)
2010 – 2019
- 2019
- [j33]Pawel Wocjan, Clive Elphick:
Spectral Lower Bounds for the Orthogonal and Projective Ranks of a Graph. Electron. J. Comb. 26(3): 3 (2019) - [j32]Clive Elphick, Pawel Wocjan:
Spectral lower bounds for the quantum chromatic number of a graph. J. Comb. Theory A 168: 338-347 (2019) - [i8]Jonathan Jakes-Schauer, David Anekstein, Pawel Wocjan:
Carving-width and contraction trees for tensor networks. CoRR abs/1908.11034 (2019) - 2018
- [j31]Dominik Janzing, Pawel Wocjan:
Does Universal Controllability of Physical Systems Prohibit Thermodynamic Cycles? Open Syst. Inf. Dyn. 25(3): 1850016:1-1850016:25 (2018) - [c2]Ali Al Kobaisi, Pawel Wocjan:
Supervised Max Hashing for Similarity Image Retrieval. ICMLA 2018: 359-365 - 2017
- [j30]Clive Elphick, Pawel Wocjan:
An Inertial Lower Bound for the Chromatic Number of a Graph. Electron. J. Comb. 24(1): 1 (2017) - 2016
- [j29]Clive Elphick, Miriam Farber, Felix Goldberg, Pawel Wocjan:
Conjectured bounds for the sum of squares of positive eigenvalues of a graph. Discret. Math. 339(9): 2215-2223 (2016) - [j28]Adam D. Bookatz, Martin Roetteler, Pawel Wocjan:
Improved Bounded-Strength Decoupling Schemes for Local Hamiltonians. IEEE Trans. Inf. Theory 62(5): 2881-2894 (2016) - 2015
- [j27]Clive Elphick, Pawel Wocjan:
Unified spectral bounds on the chromatic number. Discuss. Math. Graph Theory 35(4): 773-780 (2015) - [j26]Clive Elphick, Pawel Wocjan:
Errata: New measures of graph irregularity. Electron. J. Graph Theory Appl. 3(1): 108 (2015) - [i7]Adam D. Bookatz, Martin Roetteler, Pawel Wocjan:
Improved bounded-strength decoupling schemes for local Hamiltonians. CoRR abs/1509.00408 (2015) - 2014
- [j25]Clive Elphick, Pawel Wocjan:
New measures of graph irregularity. Electron. J. Graph Theory Appl. 2(1): 52-65 (2014) - [j24]Felix Fontein, Pawel Wocjan:
On the probability of generating a lattice. J. Symb. Comput. 64: 3-15 (2014) - [j23]Pradeep Kiran Sarvepalli, Pawel Wocjan:
Quantum algorithms for one-dimensional infrastructures. Quantum Inf. Comput. 14(1-2): 56-90 (2014) - 2013
- [j22]Pawel Wocjan, Clive Elphick:
New Spectral Bounds on the Chromatic Number Encompassing all Eigenvalues of the Adjacency Matrix. Electron. J. Comb. 20(3): 39 (2013) - [j21]Thomas Decker, Gábor Ivanyos, Miklos Santha, Pawel Wocjan:
Hidden Symmetry Subgroup Problems. SIAM J. Comput. 42(5): 1987-2007 (2013) - [i6]Clive Elphick, Pawel Wocjan:
Strengthening Turan's Theorem for Irregular Graphs. CoRR abs/1305.3570 (2013) - 2012
- [i5]Kristan Temme, Pawel Wocjan:
Efficient Computation of the Permanent of Block Factorizable Matrices. CoRR abs/1208.6589 (2012) - [i4]Pawel Wocjan, Clive Elphick:
New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix. CoRR abs/1209.3190 (2012) - [i3]Clive Elphick, Pawel Wocjan:
New spectral bounds on the chromatic number combining eigenvalues of the Laplacian and signless Laplacian. CoRR abs/1210.7844 (2012) - 2010
- [j20]Dominik Janzing, Pawel Wocjan:
A promiseBQP-complete string rewriting problem. Quantum Inf. Comput. 10(3&4): 234-257 (2010) - [j19]Chen-Fu Chiang, Daniel Nagaj, Pawel Wocjan:
Efficient circuits for quantum walks. Quantum Inf. Comput. 10(5&6): 420-434 (2010) - [p1]Chen-Fu Chiang, Pawel Wocjan:
Quantum algorithm for preparing thermal Gibbs states - detailed analysis. Quantum Cryptography and Computing 2010: 138-147
2000 – 2009
- 2009
- [j18]Thomas Decker, Jan Draisma, Pawel Wocjan:
Efficient quantum algorithm for identifying hidden polynomials. Quantum Inf. Comput. 9(3&4): 215-230 (2009) - [j17]Stephen P. Jordan, Pawel Wocjan:
Estimating Jones and Homfly polynomials with one clean qubit. Quantum Inf. Comput. 9(3&4): 264-289 (2009) - [j16]Daniel Nagaj, Pawel Wocjan, Yong Zhang:
Fast amplification of QMA. Quantum Inf. Comput. 9(11&12): 1053-1068 (2009) - 2008
- [j15]Pawel Wocjan, Jon Yard:
The Jones polynomial: quantum algorithms and applications in quantum complexity theory. Quantum Inf. Comput. 8(1): 147-180 (2008) - [j14]Pawel Wocjan, Dominik Janzing, Thomas Decker:
Measuring 4-local qubit observables could probabilistically solve PSPACE. Quantum Inf. Comput. 8(8): 741-755 (2008) - 2007
- [j13]P. Oscar Boykin, Meera Sitharam, Pham Huu Tiep, Pawel Wocjan:
Mutually unbiased bases and orthogonal decompositions of Lie algebras. Quantum Inf. Comput. 7(4): 371-382 (2007) - [j12]Andrew M. Childs, Pawel Wocjan:
On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems. Quantum Inf. Comput. 7(5): 504-521 (2007) - [j11]Dominik Janzing, Pawel Wocjan:
A Simple PromiseBQP-complete Matrix Problem. Theory Comput. 3(1): 61-79 (2007) - [c1]Andrew M. Childs, Aram W. Harrow, Pawel Wocjan:
Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem. STACS 2007: 598-609 - 2006
- [j10]Lieven Clarisse, Pawel Wocjan:
On independent permutation separability criteria. Quantum Inf. Comput. 6(3): 277-288 (2006) - [j9]Martin Rötteler, Pawel Wocjan:
Equivalence of Decoupling Schemes and Orthogonal Arrays. IEEE Trans. Inf. Theory 52(9): 4171-4181 (2006) - 2005
- [j8]Pawel Wocjan, Michal Horodecki:
Characterization of Combinatorially Independent Permutation Separability Criteria. Open Syst. Inf. Dyn. 12(4): 331-346 (2005) - [j7]Pawel Wocjan, Thomas Beth:
New construction of mutually unbiased bases in square dimensions. Quantum Inf. Comput. 5(2): 93-101 (2005) - [j6]Dominik Janzing, Pawel Wocjan:
Ergodic Quantum Computing. Quantum Inf. Process. 4(2): 129-158 (2005) - 2003
- [b1]Pawel Wocjan:
Computational power of Hamiltonians in quantum computing. Karlsruhe Institute of Technology, Germany, 2003, pp. I-V, 1-199 - [j5]Dominik Janzing, Pawel Wocjan, Thomas Beth:
On The Computational Power Of Physical Interactions: Bounds On The Number Of Time Steps For Simulating Arbitrary Interaction Graphs. Int. J. Found. Comput. Sci. 14(5): 889- (2003) - [j4]Pawel Wocjan, Dominik Janzing, Thomas Beth:
Two QCMA-complete problems. Quantum Inf. Comput. 3(6): 635-643 (2003) - [j3]Pawel Wocjan, Dominik Janzing, Thomas Beth:
Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing. Quantum Inf. Process. 2(4): 259-270 (2003) - 2002
- [j2]Pawel Wocjan, Dominik Janzing, Thomas Beth:
Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity. Quantum Inf. Comput. 2(2): 117-132 (2002) - [j1]Pawel Wocjan, Martin Rötteler, Dominik Janzing, Thomas Beth:
Universal simulation of Hamiltonians using a finite set of control operations. Quantum Inf. Comput. 2(2): 133-150 (2002) - [i2]Pawel Wocjan, Dominik Janzing, Thomas Beth:
Required sample size for learning sparse Bayesian networks with many variables. CoRR cs.LG/0204052 (2002) - 2001
- [i1]Pawel Wocjan, Dominik Janzing, Thomas Beth:
Lower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices. CoRR cs.DM/0112023 (2001)
Coauthor Index
aka: Clive Elphick
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
