Pawel Wocjan

Quantum, October, 2023

Quantum-enhanced Markov chain Monte Carlo.

[BibT_eX]

[DOI]

Nat., 2023

More tales of Hoffman: bounds for the vector chromatic number of a graph.

[BibT_eX]

[DOI]

David Anekstein

Discuss. Math. Graph Theory, 2023

2022

Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions.

[BibT_eX]

[DOI]

Srinivasan Arunachalam

Quantum, September, 2022

Space-efficient Quantization Method for Reversible Markov Chains.

[BibT_eX]

[DOI]

Chen-Fu Chiang

Anirban Chowdhury

CoRR, 2022

2021

On the complexity of quantum partition functions.

[BibT_eX]

[DOI]

CoRR, 2021

Accuracy analysis of Educational Data Mining using Feature Selection Algorithm.

[BibT_eX]

[DOI]

Ali Almalki

CoRR, 2021

Szegedy Walk Unitaries for Quantum Maps.

[BibT_eX]

[DOI]

Kristan Temme

CoRR, 2021

2020

Spectral Lower Bounds for the Quantum Chromatic Number of a Graph - Part II.

[BibT_eX]

[DOI]

Parisa Darbari

Electron. J. Comb., 2020

2019

Spectral lower bounds for the quantum chromatic number of a graph.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2019

Carving-width and contraction trees for tensor networks.

[BibT_eX]

[DOI]

Jonathan Jakes-Schauer

David Anekstein

CoRR, 2019

Spectral Lower Bounds for the Orthogonal and Projective Ranks of a Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

2018

Does Universal Controllability of Physical Systems Prohibit Thermodynamic Cycles?

[BibT_eX]

[DOI]

Open Syst. Inf. Dyn., 2018

Supervised Max Hashing for Similarity Image Retrieval.

[BibT_eX]

[DOI]

Ali Al Kobaisi

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.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

2016

Improved Bounded-Strength Decoupling Schemes for Local Hamiltonians.

[BibT_eX]

[DOI]

Adam D. Bookatz

Martin Roetteler

IEEE Trans. Inf. Theory, 2016

Conjectured bounds for the sum of squares of positive eigenvalues of a graph.

[BibT_eX]

[DOI]

Discret. Math., 2016

2015

Errata: New measures of graph irregularity.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2015

Unified spectral bounds on the chromatic number.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

2014

Quantum algorithms for one-dimensional infrastructures.

[BibT_eX]

[DOI]

Pradeep Kiran Sarvepalli

Quantum Inf. Comput., 2014

On the probability of generating a lattice.

[BibT_eX]

[DOI]

Felix Fontein

J. Symb. Comput., 2014

New measures of graph irregularity.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2014

2013

Hidden Symmetry Subgroup Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Strengthening Turan's Theorem for Irregular Graphs

[BibT_eX]

[DOI]

CoRR, 2013

New Spectral Bounds on the Chromatic Number Encompassing all Eigenvalues of the Adjacency Matrix.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

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

[BibT_eX]

[DOI]

CoRR, 2012

Efficient Computation of the Permanent of Block Factorizable Matrices

[BibT_eX]

[DOI]

Kristan Temme

CoRR, 2012

2010

Quantum algorithm for preparing thermal Gibbs states - detailed analysis.

[BibT_eX]

[DOI]

Chen-Fu Chiang

Proceedings of the Quantum Cryptography and Computing, 2010

A promiseBQP-complete string rewriting problem.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2010

Efficient circuits for quantum walks.

[BibT_eX]

[DOI]

Chen-Fu Chiang

Daniel Nagaj

Quantum Inf. Comput., 2010

2009

Fast amplification of QMA.

[BibT_eX]

[DOI]

Daniel Nagaj

Yong Zhang

Quantum Inf. Comput., 2009

Estimating Jones and Homfly polynomials with one clean qubit.

[BibT_eX]

[DOI]

Stephen P. Jordan

Quantum Inf. Comput., 2009

Efficient quantum algorithm for identifying hidden polynomials.

[BibT_eX]

[DOI]

Thomas Decker

Jan Draisma

Quantum Inf. Comput., 2009

2008

The Jones polynomial: quantum algorithms and applications in quantum complexity theory.

[BibT_eX]

[DOI]

Jon Yard

Quantum Inf. Comput., 2008

Measuring 4-local qubit observables could probabilistically solve PSPACE.

[BibT_eX]

[DOI]

Thomas Decker

Quantum Inf. Comput., 2008

2007

A Simple PromiseBQP-complete Matrix Problem.

[BibT_eX]

[DOI]

Theory Comput., 2007

On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems.

[BibT_eX]

[DOI]

Andrew M. Childs

Quantum Inf. Comput., 2007

Mutually unbiased bases and orthogonal decompositions of Lie algebras.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2007

Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem.

[BibT_eX]

[DOI]

Andrew M. Childs

Aram W. Harrow

Proceedings of the STACS 2007, 2007

2006

Equivalence of Decoupling Schemes and Orthogonal Arrays.

[BibT_eX]

[DOI]

Martin Rötteler

IEEE Trans. Inf. Theory, 2006

On independent permutation separability criteria.

[BibT_eX]

[DOI]

Lieven Clarisse

Quantum Inf. Comput., 2006

2005

Ergodic Quantum Computing.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2005

New construction of mutually unbiased bases in square dimensions.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2005

Characterization of Combinatorially Independent Permutation Separability Criteria.

[BibT_eX]

[DOI]

Michal Horodecki

Open Syst. Inf. Dyn., 2005

2003

Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2003

Two QCMA-complete problems.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2003

On The Computational Power Of Physical Interactions: Bounds On The Number Of Time Steps For Simulating Arbitrary Interaction Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

Computational power of Hamiltonians in quantum computing.

[BibT_eX]

[DOI]

PhD thesis, 2003

2002

Universal simulation of Hamiltonians using a finite set of control operations.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2002

Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2002

Required sample size for learning sparse Bayesian networks with many variables

[BibT_eX]

[DOI]

CoRR, 2002

2001

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

[BibT_eX]

[DOI]