| 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) | |
| 2011 | ||
| j18 | Daniel Nagaj, Pawel Wocjan, Yong Zhang: Fast amplification of QMA. Quantum Information & Computation 9(11): 1053-1068 (2011) | |
| 2010 | ||
| j17 | Dominik Janzing, Pawel Wocjan: A promiseBQP-complete string rewriting problem. Quantum Information & Computation 10(3&4): 234-257 (2010) | |
| j16 | Chen-Fu Chiang, Daniel Nagaj, Pawel Wocjan: Efficient circuits for quantum walks. Quantum Information & Computation 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 | |
| 2009 | ||
| j15 | Thomas Decker, Jan Draisma, Pawel Wocjan: Efficient quantum algorithm for identifying hidden polynomials. Quantum Information & Computation 9(3): 215-230 (2009) | |
| j14 | Stephen P. Jordan, Pawel Wocjan: Estimating Jones and Homfly polynomials with one clean qubit. Quantum Information & Computation 9(3): 264-289 (2009) | |
| 2008 | ||
| j13 | Pawel Wocjan, Jon Yard: The Jones polynomial: quantum algorithms and applications in quantum complexity theory. Quantum Information & Computation 8(1): 147-180 (2008) | |
| j12 | Pawel Wocjan, Dominik Janzing, Thomas Decker: Measuring 4-local qubit observables could probabilistically solve PSPACE. Quantum Information & Computation 8(8): 741-755 (2008) | |
| 2007 | ||
| j11 | P. Oscar Boykin, Meera Sitharam, Pham Huu Tiep, Pawel Wocjan: Mutually unbiased bases and orthogonal decompositions of Lie algebras. Quantum Information & Computation 7(4): 371-382 (2007) | |
| j10 | Andrew M. Childs, Pawel Wocjan: On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems. Quantum Information & Computation 7(5): 504-521 (2007) | |
| j9 | Dominik Janzing, Pawel Wocjan: A Simple PromiseBQP-complete Matrix Problem. Theory of Computing 3(1): 61-79 (2007) | |
| c1 | Andrew M. Childs, Aram Wettroth Harrow, Pawel Wocjan: Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem. STACS 2007: 598-609 | |
| 2006 | ||
| j8 | Lieven Clarisse, Pawel Wocjan: On independent permutation separability criteria. Quantum Information & Computation 6(3): 277-288 (2006) | |
| j7 | Martin Rötteler, Pawel Wocjan: Equivalence of Decoupling Schemes and Orthogonal Arrays. IEEE Transactions on Information Theory 52(9): 4171-4181 (2006) | |
| 2005 | ||
| j6 | Pawel Wocjan, Michal Horodecki: Characterization of Combinatorially Independent Permutation Separability Criteria. Open Syst. Inform. Dynam. 12(4): 331-346 (2005) | |
| j5 | Pawel Wocjan, Thomas Beth: New construction of mutually unbiased bases in square dimensions. Quantum Information & Computation 5(2): 93-101 (2005) | |
| 2003 | ||
| b1 | Pawel Wocjan: Computational power of Hamiltonians in quantum computing. Universität Karlsruhe 2003, pp. I-V, 1-199 | |
| j4 | 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) | |
| j3 | Pawel Wocjan, Dominik Janzing, Thomas Beth: Two QCMA-complete problems. Quantum Information & Computation 3(6): 635-643 (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 Information & Computation 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 Information & Computation 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) | |
Colors in the list of coauthors
Last update Sat May 25 17:55:07 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page