Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Roy, Aidan"'
Autor:
Boothby, Kelly, Enderud, Colin, Lanting, Trevor, Molavi, Reza, Tsai, Nicholas, Volkmann, Mark H., Altomare, Fabio, Amin, Mohammad H., Babcock, Michael, Berkley, Andrew J., Aznar, Catia Baron, Boschnak, Martin, Christiani, Holly, Ejtemaee, Sara, Evert, Bram, Gullen, Matthew, Hager, Markus, Harris, Richard, Hoskinson, Emile, Hilton, Jeremy P., Jooya, Kais, Huang, Ann, Johnson, Mark W., King, Andrew D., Ladizinsky, Eric, Li, Ryan, MacDonald, Allison, Fernandez, Teresa Medina, Neufeld, Richard, Norouzpour, Mana, Oh, Travis, Ozfidan, Isil, Paddon, Paul, Perminov, Ilya, Poulin-Lamarre, Gabriel, Prescott, Thomas, Raymond, Jack, Reis, Mauricio, Rich, Chris, Roy, Aidan, Esfahani, Hossein Sadeghi, Sato, Yuki, Sheldan, Ben, Smirnov, Anatoly, Swenson, Loren J., Whittaker, Jed, Yao, Jason, Yarovoy, Alexander, Bunyk, Paul I.
Early generations of superconducting quantum annealing processors have provided a valuable platform for studying the performance of a scalable quantum computing technology. These studies have directly informed our approach to the design of the next-g
Externí odkaz:
http://arxiv.org/abs/2108.02322
This paper presents an overview of the topology of D-Wave's next-generation quantum processors. It provides examples of minor embeddings and discusses performance of embedding algorithms for the new topology compared to the existing Chimera topology.
Externí odkaz:
http://arxiv.org/abs/2003.00133
Autor:
Bian, Zhengbing, Chudak, Fabian, Macready, William, Roy, Aidan, Sebastiani, Roberto, Varotti, Stefano
Quantum annealers (QAs) are specialized quantum computers that minimize objective functions over discrete variables by physically exploiting quantum effects. Current QA platforms allow for the optimization of quadratic objectives defined over binary
Externí odkaz:
http://arxiv.org/abs/1811.02524
Autor:
Retallick, Jacob, Babcock, Michael, Aroca-Ouellette, Miguel, McNamara, Shane, Wilton, Steve, Roy, Aidan, Johnson, Mark, Walus, Konrad
Advancements in computing based on qubit networks, and in particular the flux-qubit processor architecture developed by D-Wave System's Inc., have enabled the physical simulation of quantum-dot cellular automata (QCA) networks beyond the limit of cla
Externí odkaz:
http://arxiv.org/abs/1709.04972
Autor:
Bian, Zhengbing, Chudak, Fabian, Israel, Robert, Lackey, Brad, Macready, William G., Roy, Aidan
Current quantum annealing (QA) hardware suffers from practical limitations such as finite temperature, sparse connectivity, small qubit numbers, and control error. We propose new algorithms for mapping boolean constraint satisfaction problems (CSPs)
Externí odkaz:
http://arxiv.org/abs/1603.03111
The current generation of D-Wave quantum annealing processor is designed to minimize the energy of an Ising spin configuration whose pairwise interactions lie on the edges of a {\em Chimera} graph $\mathcal C_{M,N,L}$. In order to solve an Ising spin
Externí odkaz:
http://arxiv.org/abs/1507.04774
Autor:
Bian, Zhengbing, Chudak, Fabian, Macready, William, Roy, Aidan, Sebastiani, Roberto, Varotti, Stefano
Publikováno v:
In Information and Computation December 2020 275
We present a heuristic algorithm for finding a graph $H$ as a minor of a graph $G$ that is practical for sparse $G$ and $H$ with hundreds of vertices. We also explain the practical importance of finding graph minors in mapping quadratic pseudo-boolea
Externí odkaz:
http://arxiv.org/abs/1406.2741
Autor:
Vinci, Walter, Markström, Klas, Boixo, Sergio, Roy, Aidan, Spedalieri, Federico M., Warburton, Paul A., Severini, Simone
Two objects can be distinguished if they have different measurable properties. Thus, distinguishability depends on the Physics of the objects. In considering graphs, we revisit the Ising model as a framework to define physically meaningful spectral i
Externí odkaz:
http://arxiv.org/abs/1307.1114
Autor:
Roy, Aidan
This thesis is a study of large sets of unit vectors in $\cx^n$ such that the absolute value of their standard inner products takes on only a small number of values. We begin with bounds: what is the maximal size of a set of lines with only a given s
Externí odkaz:
http://arxiv.org/abs/1306.0978