Access the full text.
Sign up today, get DeepDyve free for 14 days.
(2014)
Sage Mathematics Software (Version 6.2)
(2014)
Solving the broadcast time problem using a D-wave quantum computer
Der-San Chen, R. Batson, Yu Dang (2010)
Applied Integer Programming: Modeling and Solution
M. Moghadam (2011)
Searching for Optimal Caterpillars in General and Bounded Treewidth Graphs
S. Kirkpatrick, C. Gelatt, Mario Vecchi (1983)
Optimization by Simulated AnnealingScience, 220
A. Hagberg, D. Schult, P. Swart, JM Hagberg (2008)
Exploring Network Structure, Dynamics, and Function using NetworkX
M. Dinneen, M. Fellows, V. Faber (1991)
Algebraic Constructions of Efficient Broadcast Networks
S. Hedetniemi, S. Hedetniemi, A. Liestman (1988)
A survey of gossiping and broadcasting in communication networksNetworks, 18
M. Born, V. Fock (1928)
Beweis des AdiabatensatzesZeitschrift für Physik, 51
D. Aharonov, W. Dam, J. Kempe, Zeph Landau, S. Lloyd, O. Regev (2004)
Adiabatic quantum computation is equivalent to standard quantum computation45th Annual IEEE Symposium on Foundations of Computer Science
M. Garey, David Johnson (1978)
Computers and Intractability: A Guide to the Theory of NP-Completeness
N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller (1953)
Equation of state calculations by fast computing machinesJournal of Chemical Physics, 21
(1979)
Discret
A. Farley, S. Hedetniemi, Sandra Mitchell, A. Proskurowski (1979)
Minimum broadcast graphsDiscret. Math., 25
C. Papadimitriou, K. Steiglitz (1981)
Combinatorial Optimization: Algorithms and Complexity
M. Dinneen (1994)
The complexity of broadcasting in bounded-degree networksArXiv, abs/math/9411222
E. Farhi, J. Goldstone, S. Gutmann, M. Sipser (2000)
Quantum Computation by Adiabatic EvolutionarXiv: Quantum Physics
(2014)
Mathematics Software (Version 6.3)
M. Juncosa (1970)
The Monte Carlo Method (Yu. A. Shreider)Siam Review, 12
(1994)
In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, FOCS’94, pp
N. Metropolis, S. Ulam (1949)
The Monte Carlo method.Journal of the American Statistical Association, 44 247
[We illustrate how the D-Wave Two quantum computer is programmed and works by solving the Broadcast Time Problem. We start from a concise integer program formulation of the problem and apply some simple transformations to arrive at the QUBO form which can be run on the D-Wave quantum computer. Finally, we explore the feasibility of this method on several well-known graphs.]
Published: Jul 19, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.