Zobrazeno 1 - 10
of 428
pro vyhledávání: '"Weber, Steven A."'
Autor:
Menke, Tim, Banner, William P., Bergamaschi, Thomas R., Di Paolo, Agustin, Vepsäläinen, Antti, Weber, Steven J., Winik, Roni, Melville, Alexander, Niedzielski, Bethany M., Rosenberg, Danna, Serniak, Kyle, Schwartz, Mollie E., Yoder, Jonilyn L., Aspuru-Guzik, Alán, Gustavsson, Simon, Grover, Jeffrey A., Hirjibehedin, Cyrus F., Kerman, Andrew J., Oliver, William D.
Nonpairwise multi-qubit interactions present a useful resource for quantum information processors. Their implementation would facilitate more efficient quantum simulations of molecules and combinatorial optimization problems, and they could simplify
Externí odkaz:
http://arxiv.org/abs/2205.04542
Autor:
Bergamaschi, Thomas R., Menke, Tim, Banner, William P., Di Paolo, Agustin, Weber, Steven J., Hirjibehedin, Cyrus F., Kerman, Andrew J., Oliver, William D.
Multi-spin interactions can be engineered with artificial quantum spins. However, it is challenging to verify such interactions experimentally. Here we describe two methods to characterize the $n$-local coupling of $n$ spins. First, we analyze the va
Externí odkaz:
http://arxiv.org/abs/2111.12717
Autor:
Tennant, Daniel M., Dai, Xi, Martinez, Antonio J., Trappen, Robbyn, Melanson, Denis, Yurtalan, M A., Tang, Yongchao, Bedkihal, Salil, Yang, Rui, Novikov, Sergei, Grover, Jeffery A., Disseler, Steven M., Basham, James I., Das, Rabindra, Kim, David K., Melville, Alexander J., Niedzielski, Bethany M., Weber, Steven J., Yoder, Jonilyn L., Kerman, Andrew J., Mozgunov, Evgeny, Lidar, Daniel A., Lupascu, Adrian
Publikováno v:
npj Quantum Information 8, 85 (2022)
Spin chains have long been considered an effective medium for long-range interactions, entanglement generation, and quantum state transfer. In this work, we explore the properties of a spin chain implemented with superconducting flux circuits, design
Externí odkaz:
http://arxiv.org/abs/2111.04284
Autor:
Weber, Steven
Publikováno v:
Bus. Polit. 24 (2022) 96-112
This paper explores the hypothesis that the diversity of human languages, right now a barrier to interoperability in communication and trade, will become significantly less of a barrier as machine translation technologies are deployed over the next s
Externí odkaz:
http://arxiv.org/abs/2011.01007
Autor:
Stokes, Jonathan, Weber, Steven
Star sampling (SS) is a random sampling procedure on a graph wherein each sample consists of a randomly selected vertex (the star center) and its (one-hop) neighbors (the star points). We consider the use of SS to find any member of a target set of v
Externí odkaz:
http://arxiv.org/abs/1910.00431
Autor:
Lienhard, Benjamin, Braumüller, Jochen, Woods, Wayne, Rosenberg, Danna, Calusine, Greg, Weber, Steven, Vepsäläinen, Antti, O'Brien, Kevin, Orlando, Terry P., Gustavsson, Simon, Oliver, William D.
Publikováno v:
Proceedings of the 2019 IEEE/MTT-S International Microwave Symposium, Boston, MA, USA, pp. 275-278, 2019
Over the past two decades, the performance of superconducting quantum circuits has tremendously improved. The progress of superconducting qubits enabled a new industry branch to emerge from global technology enterprises to quantum computing startups.
Externí odkaz:
http://arxiv.org/abs/1906.05425
Autor:
Stokes, Jonathan, Weber, Steven
Star sampling (SS) is a random sampling procedure on a graph wherein each sample consists of a randomly selected vertex (the star center) and its one-hop neighbors (the star endpoints). We consider the use of star sampling to find any member of an ar
Externí odkaz:
http://arxiv.org/abs/1901.03393
Autor:
An, Ni, Weber, Steven
A natural basis for the detection of a wireless random reactive jammer (RRJ) is the perceived violation by the detector (typically located at the access point (AP)) of the carrier sensing protocol underpinning many wireless random access protocols (e
Externí odkaz:
http://arxiv.org/abs/1809.04263
Autor:
Stokes, Jonathan, Weber, Steven
We examine two greedy heuristics - wiring and rewiring - for constructing maximum assortative graphs over all simple connected graphs with a target degree sequence. Counterexamples show that natural greedy rewiring heuristics do not necessarily retur
Externí odkaz:
http://arxiv.org/abs/1705.00382
Recent algorithmic developments have enabled computers to automatically determine and prove the capacity regions of small hypergraph networks under network coding. A structural theory relating network coding problems of different sizes is developed t
Externí odkaz:
http://arxiv.org/abs/1704.01891