![]() ![]() A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem. Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. In Foundations of Computer Science (FOCS), 2017 IEEE 58th Annual Symposium on, pages 427–438. Local Hamiltonians whose ground states are hard to approximate. Wigner function negativity and contextuality in quantum computation on rebits. Nicolas Delfosse, Philippe Allard Guerin, Jacob Bian, and Robert Raussendorf. Massively parallel quantum computer simulator. Koen De Raedt, Kristel Michielsen, Hans De Raedt, Binh Trieu, Guido Arnold, Marcus Richter, Th Lippert, H Watanabe, and N Ito. Quantum ground state isoperimetric inequalities for the energy spectrum of local hamiltonians. Classical simulation of intermediate-size quantum circuits. Jianxin Chen, Fang Zhang, Mingcheng Chen, Cupjin Huang, Michael Newman, and Yaoyun Shi. Catalysis and activation of magic states in fault-tolerant architectures. ![]() Average-case complexity versus approximate simulation of commuting quantum computations. Michael J Bremner, Ashley Montanaro, and Dan J Shepherd. Trading classical and quantum computational resources. Sergey Bravyi, Graeme Smith, and John A. Ghz extraction yield for multipartite stabilizer states. Sergey Bravyi, David Fattal, and Daniel Gottesman. Universal quantum computation with ideal Clifford gates and noisy ancillas. Improved classical simulation of quantum circuits dominated by Clifford gates. Characterizing quantum supremacy in near-term devices. Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, Michael J Bremner, John M Martinis, and Hartmut Neven. Simulation of low-depth quantum circuits as complex undirected graphical models. Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, and Hartmut Neven. Unbiased simulation of near-Clifford quantum circuits. Fast simulation of stabilizer circuits using a graph-state representation. Transversal numbers of uniform hypergraphs. Qiskit: An open-source framework for quantum computing, 2019. Wildstrom, Jessica Wilson, Erick Winston, Christopher Wood, Stephen Wood, Stefan Wörner, Ismail Yunus Akhalwaya, and Christa Zoufal. Smolin, Mathias Soeken, Hitomi Takahashi, Ivano Tavernelli, Charles Taylor, Pete Taylour, Kenso Trabing, Matthew Treinish, Wes Turner, Desiree Vogt-Lee, Christophe Vuillot, Jonathan A. McClure, David McKay, Srujan Meesala, Antonio Mezzacapo, Nikolaj Moll, Diego Moreda Rodríguez, Giacomo Nannicini, Paul Nation, Pauline Ollitrault, Lee James O'Riordan, Hanhee Paik, Jesús Pérez, Anna Phan, Marco Pistoia, Viktor Prutyanov, Max Reuter, Julia Rice, Abdón Rodríguez Davila, Raymond Harry Putra Rudy, Mingi Ryu, Ninad Sathaye, Chris Schnabel, Eddie Schoute, Kanav Setia, Yunong Shi, Adenilton Silva, Yukio Siraichi, Seyon Sivarajah, John A. Cross, Andrew Cross, Juan Cruz-Benito, Chris Culver, Salvador De La Puente González, Enrique De La Torre, Delton Ding, Eugene Dumitrescu, Ivan Duran, Pieter Eendebak, Mark Everitt, Ismael Faro Sertage, Albert Frisch, Andreas Fuhrer, Jay Gambetta, Borja Godoy Gago, Juan Gomez-Mosquera, Donny Greenberg, Ikko Hamamura, Vojtech Havlicek, Joe Hellmers, Łukasz Herok, Hiroshi Horii, Shaohan Hu, Takashi Imamichi, Toshinari Itoko, Ali Javadi-Abhari, Naoki Kanazawa, Anton Karazeev, Kevin Krsulich, Peng Liu, Yang Luh, Yunho Maeng, Manoel Marques, Francisco Jose Martín-Fernández, Douglas T. Gadi Aleksandrowicz, Thomas Alexander, Panagiotis Barkoutsos, Luciano Bello, Yael Ben-Haim, David Bucher, Francisco Jose Cabrera-Hernández, Jorge Carballo-Franquis, Adrian Chen, Chun-Fu Chen, Jerry M. Interactive proofs for quantum computations. Dorit Aharonov, Michael Ben-Or, Elad Eban, and Urmila Mahadev. Improved simulation of stabilizer circuits. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017. In 32nd Computational Complexity Conference (CCC 2017). Complexity-theoretic foundations of quantum supremacy experiments. The computational cost of such methods is directly related to the notion of $\it, Recent work has explored using the stabilizer formalism to classically simulate quantum circuits containing a few non-Clifford gates. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |