Fetching the paper…
Reading the bibliography…
Quantum computation promises to advance a wide range of computational tasks.
Some network flow problems solved with pseudo-boolean programming
Peter L. Ivănescu · 1965
Earlier work this paper cites.
Finding a maximum cut of a planar graph in polynomial time
F. Hadlock · 1975
Earlier work this paper cites.
The boolean quadric polytope: Some characteristics, facets and relatives
Manfred W. Padberg · 1989
Earlier work this paper cites.
Experiments in quadratic 0–1 programming
Francisco Barahona, Michael Jünger, and Gerhard Reinelt · 1989
Earlier work this paper cites.
The cut polytope and the boolean quadric polytope
Caterina De Simone · 1990
Earlier work this paper cites.
A new reformulation-linearization technique for bilinear programming problems
Hanif D. Sherali and Amine Alameddine · 1992
Earlier work this paper cites.
A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation
M. J. D. Powell · 1994
Earlier work this paper cites.
Geometry of Cuts and Metrics
Michel Deza and Monique Laurent · 1997
Earlier work this paper cites.
Dynamical suppression of decoherence in two-state quantum systems
Lorenza Viola and Seth Lloyd · 1998
Earlier work this paper cites.
Cartan decomposition of su(2n) and control of spin systems
Navin Khaneja and Steffen J. Glaser · 2001
Earlier work this paper cites.
Reducibility among combinatorial problems
Richard M. Karp · 2001
Earlier work this paper cites.
Alibaba cloud quantum development platform: Surface code simulations with crosstalk, 2020
Cupjin Huang, Xiaotong Ni, Fang Zhang, Michael Newman, Dawei Ding, Xun Gao, Tenghui Wang, Hui-Hai Zhao, Feng Wu, Gengyan Zhang, Chunqing Deng, Hsiang-Sheng Ku, Jianxin Chen, and Yaoyun Shi · 2002
Earlier work this paper cites.
Graph colouring problems and their applications in scheduling
Dániel Marx · 2004
Earlier work this paper cites.
Computing Exact Ground States of Hard Ising Spin Glass Problems by Branch-and-Cut
Frauke Liers, Michael Jünger, Gerhard Reinelt, and Giovanni Rinaldi · 2004
Earlier work this paper cites.
Quantum error correction of coherent errors by randomization
O. Kern, G. Alber, and D. L. Shepelyansky · 2005
Earlier work this paper cites.
The bipartite boolean quadric polytope with multiple-choice constraints, 2020
Andreas Bärmann, Alexander Martin, and Oskar Schneider · 2009
Earlier work this paper cites.
Quantum Computation and Quantum Information: 10th Anniversary Edition
Michael A. Nielsen and Isaac L. Chuang · 2010
Earlier work this paper cites.
Fully microwave-tunable universal gates in superconducting qubits with linear couplings and fixed transition frequencies
Chad Rigetti and Michel Devoret · 2010
Earlier work this paper cites.
Scalable and robust randomized benchmarking of quantum processes
Easwar Magesan, J. M. Gambetta, and Joseph Emerson · 2011
Earlier work this paper cites.
Characterizing quantum gates via randomized benchmarking
Easwar Magesan, Jay M. Gambetta, and Joseph Emerson · 2012
Earlier work this paper cites.
Efficient measurement of quantum gate error by interleaved randomized benchmarking
Easwar Magesan, Jay M. Gambetta, B. R. Johnson, Colm A. Ryan, Jerry M. Chow, Seth T. Merkel, Marcus P. da Silva, George A. Keefe, Mary B. Rothwell, Thomas A. Ohki, Mark B. Ketchen, and M. Steffen · 2012
Earlier work this paper cites.
Characterization of addressability by simultaneous randomized benchmarking
Jay M. Gambetta, A. D. Có rcoles, S. T. Merkel, B. R. Johnson, John A. Smolin, Jerry M. Chow, Colm A. Ryan, Chad Rigetti, S. Poletto, Thomas A. Ohki, Mark B. Ketchen, and M. Steffen · 2012
Earlier work this paper cites.
Partitioning planar graphs: A fast combinatorial approach for max-cut
Frauke Liers and G. Pardella · 2012
Earlier work this paper cites.
A quantum approximate optimization algorithm, 2014
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Earlier work this paper cites.
Noise tailoring for scalable quantum computation via randomized compiling
Joel J. Wallman and Joseph Emerson · 2016
Earlier work this paper cites.
Advanced Techniques for Graph Colouring
R. M. R. Lewis · 2016
Earlier work this paper cites.
Approximation and Hardness of Token Swapping
Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Günter Rote, Antonis Thomas, and Takeaki Uno · 2016
Earlier work this paper cites.
A note on simplicial bilinear optimizations, 2016
Gupte Akshay · 2016
Earlier work this paper cites.
Quantum machine learning
Jacob Biamonte, Peter Wittek, Nicola Pancotti, Patrick Rebentrost, Nathan Wiebe, and Seth Lloyd · 2017
Earlier work this paper cites.
Error mitigation for short-depth quantum circuits
Kristan Temme, Sergey Bravyi, and Jay M. Gambetta · 2017
Earlier work this paper cites.
An efficient methodology for mapping quantum circuits to the IBM QX architectures
Alwin Zulehner, Alexandru Paler, and Robert Wille · 2018
Earlier work this paper cites.
Comparing and integrating constraint programming and temporal planning for quantum circuit compilation
Kyle Booth, Minh do, J. Beck, Eleanor Rieffel, Davide Venturelli, and Jeremy Frank · 2018
Earlier work this paper cites.
Constructing smaller pauli twirling sets for arbitrary error channels
Zhenyu Cai and Simon C. Benjamin · 2019
Earlier work this paper cites.
Noise-adaptive compiler mappings for noisy intermediate-scale quantum computers
Prakash Murali, Jonathan M. Baker, Ali Javadi-Abhari, Frederic T. Chong, and Margaret Martonosi · 2019
Earlier work this paper cites.
A quantum engineer’s guide to superconducting qubits
P. Krantz, M. Kjaergaard, F. Yan, T. P. Orlando, S. Gustavsson, and W. D. Oliver · 2019
Earlier work this paper cites.
Three-qubit randomized benchmarking
David C. McKay, Sarah Sheldon, John A. Smolin, Jerry M. Chow, and Jay M. Gambetta · 2019
Cited alongside, same era.
Direct randomized benchmarking for multiqubit devices
Timothy J. Proctor, Arnaud Carignan-Dugas, Kenneth Rudinger, Erik Nielsen, Robin Blume-Kohout, and Kevin Young · 2019
Cited alongside, same era.
Characterizing large-scale quantum computers via cycle benchmarking
Alexander Erhard, Joel J. Wallman, Lukas Postler, Michael Meth, Roman Stricker, Esteban A. Martinez, Philipp Schindler, Thomas Monz, Joseph Emerson, and Rainer Blatt · 2019
Cited alongside, same era.
Methods for measuring magnetic flux crosstalk between tunable transmons
Deanna M. Abrams, Nicolas Didier, Shane A. Caldwell, Blake R. Johnson, and Colm A. Ryan · 2019
Cited alongside, same era.
Probing context-dependent errors in quantum processors
Kenneth Rudinger, Timothy Proctor, Dylan Langharst, Mohan Sarovar, Kevin Young, and Robin Blume-Kohout · 2019
Cited alongside, same era.
Quantum crosstalk analysis for simultaneous gate operations on superconducting qubits
Peng Zhao, Kehuan Linghu, Zhiyuan Li, Peng Xu, Ruixia Wang, Guangming Xue, Yirong Jin, and Haifeng Yu · 2022
Later among the works it cites.
Optimizing frequency allocation for fixed-frequency superconducting quantum processors
Alexis Morvan, Larry Chen, Jeffrey M. Larson, David I. Santiago, and Irfan Siddiqi · 2022
Later among the works it cites.
Noise-adaptive quantum compilation strategies evaluated with application-motivated benchmarks
Davide Ferrari and Micshele Amoretti · 2022
Later among the works it cites.
Optimal qubit assignment and routing via integer programming
Giacomo Nannicini, Lev S. Bishop, Oktay Günlük, and Petar Jurcevic · 2022
Later among the works it cites.
Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
Johannes Weidenfeller, Lucia C. Valor, Julien Gacon, Caroline Tornow, Luciano Bello, Stefan Woerner, and Daniel J. Egger · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Gushu Li, Yufei Ding, and Yuan Xie · 2019
Cited alongside, same era.
Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations
Robert Wille, Lukas Burgholzer, and Alwin Zulehner · 2019
Cited alongside, same era.
Quantum algorithms for quantum chemistry and quantum materials science
Bela Bauer, Sergey Bravyi, Mario Motta, and Garnet Kin-Lic Chan · 2020
Cited alongside, same era.
Extracting success from IBM’s 20-qubit machines using error-aware compilation
Shin Nishio, Yulu Pan, Takahiko Satoh, Hideharu Amano, and Rodney Van Meter · 2020
Cited alongside, same era.
A hardware-aware heuristic for the qubit mapping problem in the NISQ era
Siyuan Niu, Adrien Suau, Gabriel Staffelbach, and Aida Todri-Sanial · 2020
Cited alongside, same era.
Detecting crosstalk errors in quantum information processors
Mohan Sarovar, Timothy Proctor, Kenneth Rudinger, Kevin Young, Erik Nielsen, and Robin Blume-Kohout · 2020
Cited alongside, same era.
Software mitigation of crosstalk on noisy intermediate-scale quantum computers
Prakash Murali, David C. Mckay, Margaret Martonosi, and Ali Javadi-Abhari · 2020
Cited alongside, same era.
Amira Abbas, Andris Ambainis, Brandon Augustino, Andreas Bärtschi, Harry Buhrman, Carleton Coffrin, Giorgio Cortiana, Vedran Dunjko, Daniel J. Egger, Bruce G. Elmegreen, Nicola Franco, Filippo Fratini, Bryce Fuller, Julien Gacon, Constantin Gonciulea, Sander Gribling, Swati Gupta, Stuart Hadfield, Raoul Heese, Gerhard Kircher, Thomas Kleinert, Thorsten Koch, Georgios Korpas, Steve Lenk, Jakub Marecek, Vanio Markov, Guglielmo Mazzola, Stefano Mensa, Naeimeh Mohseni, Giacomo Nannicini, Corey O’Meara, Elena Peña Tapia, Sebastian Pokutta, Manuel Proissl, Patrick Rebentrost, Emre Sahin, Benjamin C. B. Symons, Sabine Tornow, Victor Valls, Stefan Woerner, Mira L. Wolf-Bauwens, Jon Yard, Sheir Yarkoni, Dirk Zechiel, Sergiy Zhuk, and Christa Zoufal · 2023
Later among the works it cites.
Evidence for the utility of quantum computing before fault tolerance
Youngseok Kim, Andrew Eddins, Sajant Anand, Ken Wei, Ewout Berg, Sami Rosenblatt, Hasan Nayfeh, Yantao Wu, Michael Zaletel, Kristan Temme, and Abhinav Kandala · 2023
Later among the works it cites.
A theory of direct randomized benchmarking, 2023
Anthony M. Polloreno, Arnaud Carignan-Dugas, Jordan Hines, Robin Blume-Kohout, Kevin Young, and Timothy Proctor · 2023
Later among the works it cites.
The error reconstruction and compiled calibration of quantum computing cycles, 2023
Arnaud Carignan-Dugas, Dar Dahlen, Ian Hincks, Egor Ospadov, Stefanie J. Beale, Samuele Ferracin, Joshua Skanes-Norman, Joseph Emerson, and Joel J. Wallman · 2023
Later among the works it cites.
Suppression of crosstalk in quantum circuit based on instruction exchange rules and duration
Zhijin Guan, Renjie Liu, Xueyun Cheng, Shiguang Feng, and Pengcheng Zhu · 2023
Later among the works it cites.
Characterizing crosstalk of superconducting transmon processors
Andreas Ketterer and Thomas Wellens · 2023
Later among the works it cites.
Floquet analysis of frequency collisions, 2023
Kentaro Heya, Moein Malekakhlagh, Seth Merkel, Naoki Kanazawa, and Emily Pritchett · 2023
Later among the works it cites.
Trim: crosstalk-aware qubit mapping for multiprogrammed quantum systems
Soheil Khadirsharbiyani, Movahhed Sadeghi, Mostafa Eghbali Zarch, Jagadish Kotra, and Mahmut Taylan Kandemir · 2023
Later among the works it cites.
Quantum crosstalk robust quantum control
Zeyuan Zhou, Ryan Sitler, Yasuo Oda, Kevin Schultz, and Gregory Quiroz · 2023
Later among the works it cites.
Improving quantum computation by optimized qubit routing
Friedrich Wagner, Andreas Bärmann, Frauke Liers, and Markus Weissenbäck · 2023
Later among the works it cites.
High-threshold and low-overhead fault-tolerant quantum memory, 2023
Sergey Bravyi, Andrew W. Cross, Jay M. Gambetta, Dmitri Maslov, Patrick Rall, and Theodore J. Yoder · 2023
Later among the works it cites.
Suppressing quantum errors by scaling a surface code logical qubit
Rajeev Acharya, I. Aleiner, Richard Allen, Trond Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Abraham Asfaw, Juan Atalaya, Ryan Babbush, Dave Bacon, Joseph Bardin, Joao Basso, Andreas Bengtsson, Sergio Boixo, Gina Bortoli, Alexandre Bourassa, Jenna Bovaird, Leon Brill, and Ningfeng Zhu · 2023
Later among the works it cites.
Gurobi Optimizer Reference Manual, 2023
Gurobi Optimization, LLC · 2023
Later among the works it cites.
Qiskit experiments: A python package to characterize and calibrate quantum computers
Naoki Kanazawa, Daniel J. Egger, Yael Ben-Haim, Helena Zhang, William E. Shanks, Gadi Aleksandrowicz, and Christopher J. Wood · 2023
Later among the works it cites.
A SAT approach to the initial mapping problem in SWAP gate insertion for commuting gates
Atsushi Matsuo, Shigeru Yamashita, and Daniel J. Egger · 2023
Later among the works it cites.
On optimal subarchitectures for quantum circuit mapping
Tom Peham, Lukas Burgholzer, and Robert Wille · 2023
Later among the works it cites.
Provable bounds for noise-free expectation values computed from noisy samples, 2023
Samantha V. Barron, Daniel J. Egger, Elijah Pelofske, Andreas Bärtschi, Stephan Eidenbenz, Matthis Lehmkuehler, and Stefan Woerner · 2023
Later among the works it cites.
Faster exact solution of sparse maxcut and qubo problems
Daniel Rehfeldt, Thorsten Koch, and Yuji Shinano · 2023
Later among the works it cites.
Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm
Danylo Lykov, Jonathan Wurtz, Cody Poole, Mark Saffman, Tom Noel, and Yuri Alexeev · 2023
Later among the works it cites.
Bridging classical and quantum with sdp initialized warm-starts for qaoa
Reuben Tate, Majid Farhadi, Creston Herold, Greg Mohler, and Swati Gupta · 2023
Later among the works it cites.
Qiskit: An open-source framework for quantum computing, 2023
Qiskit contributors · 2023
Later among the works it cites.
Benchmarking quantum processor performance at scale, 2023
David C. McKay, Ian Hincks, Emily J. Pritchett, Malcolm Carroll, Luke C. G. Govia, and Seth T. Merkel · 2023
Later among the works it cites.
Noise-aware token swapping for qubit routing
Asim Sharma and Avah Banerjee · 2023
Later among the works it cites.
Large-scale quantum approximate optimization on nonplanar graphs with machine learning noise mitigation
Stefan H. Sack and Daniel J. Egger · 2024
Closest in time.
Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer
Hugo Perrin, Thibault Scoquart, Alexander Shnirman, Jörg Schmalian, and Kyrylo Snizhko · 2024
Closest in time.
Optimized Noise Suppression for Quantum Circuits, 2024
Friedrich Wagner, Daniel J. Egger, and Frauke Liers · 2024
Closest in time.
Edge coloring lattice graphs, 2024
Joris Kattemölle · 2024
Closest in time.
Quantum optimization using variational algorithms on near-term quantum devices
Nikolaj Moll, Panagiotis Barkoutsos, Lev S. Bishop, Jerry M. Chow, Andrew Cross, Daniel J. Egger, Stefan Filipp, Andreas Fuhrer, Jay M. Gambetta, Marc Ganzhorn, Abhinav Kandala, Antonio Mezzacapo, Peter Müller, Walter Riess, Gian Salis, John Smolin, Ivano Tavernelli, and Kristan Temme · 2058
Closest in time.
t | | ket ⟩ \rangle : a retargetable compiler for NISQ devices
Seyon Sivarajah, Silas Dilkes, Alexander Cowtan, Will Simmons, Alec Edgington, and Ross Duncan · 2058
Closest in time.