Aidan Roy

Available identifiers

Publication	Date of Publication	Type
Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results	2020-12-15	Paper
Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report	2018-01-04	Paper
Uniform mixing and association schemes	2017-09-08	Paper
Fast clique minor generation in Chimera qubit connectivity graphs	2016-04-04	Paper
A practical heuristic for finding graph minors	2014-06-10	Paper
Complex spherical designs and codes	2014-05-02	Paper
Complex Lines with Restricted Angles	2013-06-05	Paper
Entanglement can increase asymptotic rates of zero-error classical communication over classical channels	2012-04-04	Paper
Local extrema of entropy functions under tensor products	2011-12-01	Paper
Minimal Euclidean representations of graphs	2010-04-27	Paper
Bounds for codes and designs in complex subspaces	2010-03-17	Paper
Unitary designs and codes	2009-11-04	Paper
Two Characterizations of Crooked Functions	2009-02-24	Paper
Equiangular lines, mutually unbiased bases, and spin models	2009-01-27	Paper
On the epistemic view of quantum states	2009-01-23	Paper
Weighted complex projective 2-designs from bases: Optimal state determination by orthogonal measurements	2008-10-14	Paper
The chromatic number and rank of the complements of the Kasami graphs	2007-02-02	Paper
Maximal graphs and graphs with maximal spectral radius	2002-06-24	Paper

This page was built for person: Aidan Roy