Fetching the paper…
Reading the bibliography…
Noisy Intermediate-Scale Quantum (NISQ) algorithms, which run on noisy quantum computers should be carefully designed to boost the output state fidelity.
1903
Earlier work this paper cites.
E. Bernstein and U. Vazirani, “Quantum complexity theory,” SIAM J. Comput. , vol. 26, no. 5, p. 1411–1473, Oct. 1997
1997
Earlier work this paper cites.
W. van Dam, S. Hallgren, and L. Ip, “Quantum algorithms for some hidden shift problems,” in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , ser. SODA ’03. USA: Society for Industrial and Applied Mathematics, 2003, p. 489–498
2003
Earlier work this paper cites.
S. A. Cuccaro, T. G. Draper, S. A. Kutin, and D. Petrie Moulton, “A new quantum ripple-carry addition circuit,” arXiv e-prints , pp. quant–ph/0 410 184, Oct. 2004
2004
Earlier work this paper cites.
D. Maslov, G. Dueck, and D. Miller, “Toffoli network synthesis with templates,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems , vol. 24, no. 6, pp. 807–817, 2005
2005
Earlier work this paper cites.
R. Wille, D. Grosse, L. Teuber, G. W. Dueck, and R. Drechsler, “Revlib: An online resource for reversible functions and reversible circuits,” in Proceedings of International Symposium on Multiple Valued Logic , 2008, pp. 220–225
2008
Earlier work this paper cites.
E. Magesan, J. M. Gambetta, and J. Emerson, “Characterizing quantum gates via randomized benchmarking,” Phys. Rev. A , vol. 85, p. 042311, 2012
2012
Earlier work this paper cites.
E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” 2014
2014
Earlier work this paper cites.
S. Janardan, Y. Tomita, M. Gutierrez, and K. R. Brown, “Analytical error analysis of clifford gates by the fault-path tracer method,” Quantum Information Processing , vol. 15, no. 8, pp. 3065–3079, 2016
2016
Earlier work this paper cites.
Y. Nam, N. J. Ross, Y. Su, A. M. Childs, and D. Maslov, “Automated optimization of large quantum circuits with continuous parameters,” npj Quantum Inf , vol. 4, no. 23, 2018
2018
Earlier work this paper cites.
M. Y. Siraichi, V. F. d. Santos, S. Collange, and F. M. Q. Pereira, “Qubit allocation,” in Proceedings of CGO . ACM, 2018, pp. 113–125
2018
Earlier work this paper cites.
A. Zulehner, A. Paler, and R. Wille, “An efficient methodology for mapping quantum circuits to the ibm qx architectures,” 2018
2018
Earlier work this paper cites.
G. E. Crooks, “Performance of the quantum approximate optimization algorithm on the maximum cut problem,” 2018
2018
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information . Cambridge University Press, 2019
2019
Cited alongside, same era.
S. S. Tannu and M. K. Qureshi, “Not all qubits are created equal: A case for variability-aware policies for nisq-era quantum computers,” in Proceedings of ASPLOS . ACM, 2019, pp. 987–999
2019
Cited alongside, same era.
T. Itoko, R. Raymond, T. Imamichi, and A. Matsuo, “Optimization of quantum circuit mapping using gate transformation and commutation,” 2019
2019
Cited alongside, same era.
A. Matsuo, W. Hattori, and S. Yamashita, “Reducing the overhead of mapping quantum circuits to ibm q system,” in 2019 IEEE International Symposium on Circuits and Systems (ISCAS) , 2019, pp. 1–5
2019
Cited alongside, same era.
R. Wille, L. Burgholzer, and A. Zulehner, “Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations,” in Proceedings of DAC , 2019, pp. 142–1
M. Alam, A. Ash-Saki, and S. Ghosh, “Circuit compilation methodologies for quantum approximate optimization algorithm,” in 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) , 2020, pp. 215–228
2020
Later among the works it cites.
L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. D. Lukin, “Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices,” Phys. Rev. X , vol. 10, p. 021067, Jun 2020. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevX.10.021067
2020
Later among the works it cites.
N. Acharya and S. M. Saeed, “A lightweight approach to detect malicious/unexpected changes in the error rates of nisq computers,” in Proceedings of the 39th International Conference on Computer-Aided Design , ser. ICCAD ’20. New York, NY, USA: Association for Computing Machinery, 2020. [Online]. Available: https://doi.org/10.1145/3400302.3415684
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
G. Li, Y. Ding, and Y. Xie, “Tackling the qubit mapping problem for nisq-era quantum devices,” in Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems , ser. ASPLOS ’19. New York, NY, USA: Association for Computing Machinery, 2019, p. 1001–1014
2019
Cited alongside, same era.
A. Ash-Saki, M. Alam, and S. Ghosh, “Qure: Qubit re-allocation in noisy intermediate-scale quantum computers,” in Proceedings of ACM/IEEE Design Automation Conference , 2019, pp. 141:1–141:6
2019
Cited alongside, same era.
M. Alam, A. Ash-Saki, and S. Ghosh, “Addressing temporal variations in qubit quality metrics for parameterized quantum circuits,” in 2019 IEEE/ACM International Symposium on Low Power Electronics and Design (ISLPED) , 2019, pp. 1–6
2019
Cited alongside, same era.
S. S. Tannu and M. Qureshi, “Ensemble of diverse mappings: Improving reliability of quantum computers by orchestrating dissimilar mistakes,” in Proceedings of MICRO , 2019, pp. 253–265
2019
Cited alongside, same era.
Y. Shi, N. Leung, P. Gokhale, Z. Rossi, D. I. Schuster, H. Hoffmann, and F. T. Chong, “Optimized compilation of aggregated instructions for realistic quantum computers,” Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems , Apr 2019. [Online]. Available: http://dx.doi.org/10.1145/3297858.3304018
2019
Cited alongside, same era.
H. Abraham and et al., “Qiskit: An open-source framework for quantum computing,” 2019
2019
Cited alongside, same era.
A. W. Cross, L. S. Bishop, S. Sheldon, P. D. Nation, and J. M. Gambetta, “Validating quantum computers using randomized model circuits,” Physical Review A , vol. 100, no. 3, Sep 2019. [Online]. Available: http://dx.doi.org/10.1103/PhysRevA.100.032328
2019
Cited alongside, same era.
P. Murali, D. C. Mckay, M. Martonosi, and A. Javadi-Abhari, “Software mitigation of crosstalk on noisy intermediate-scale quantum computers,” in Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems , 2020, p. 1001–1016
2020
Later among the works it cites.
M. Alam, A. A. . Saki, and S. Ghosh, “An efficient circuit compilation flow for quantum approximate optimization algorithm,” in 2020 57th ACM/IEEE Design Automation Conference (DAC) , 2020, pp. 1–6
2020
Later among the works it cites.
B. Tan and J. Cong, “Optimal layout synthesis for quantum computing,” in Proceedings of the 39th International Conference on Computer-Aided Design , ser. ICCAD ’20. New York, NY, USA: Association for Computing Machinery, 2020. [Online]. Available: https://doi.org/10.1145/3400302.3415620
2020
Later among the works it cites.
Q. A. team and collaborators, “Cirq,” Oct. 2020. [Online]. Available: https://doi.org/10.5281/zenodo.4062499
2020
Later among the works it cites.
K. Hietala, R. Rand, S.-H. Hung, X. Wu, and M. Hicks, “A verified optimizer for quantum circuits,” Proc. ACM Program. Lang. , vol. 5, no. POPL, Jan. 2021. [Online]. Available: https://doi.org/10.1145/3434318
2021
Later among the works it cites.
J. Kusyk, S. Saeed, and M. U. Uyar, “Survey on quantum circuit compilation for noisy intermediate-scale quantum computers - artificial intelligence to heuristics,” IEEE Transactions on Quantum Engineering , pp. 1–1, 2021
2021
Later among the works it cites.
S. Resch, S. Tannu, U. R. Karpuzcu, and M. Qureshi, “A day in the life of a quantum error,” IEEE Computer Architecture Letters , vol. 20, no. 1, pp. 13–16, 2021
2021
Later among the works it cites.
G. G. Guerreschi and J. Park, “Two-step approach to scheduling quantum circuits,” Quantum Science and Technology , vol. 3, no. 4, p. 045003, Jul 2018. [Online]. Available: http://dx.doi.org/10.1088/2058-9565/aacf0b
2058
Closest in time.
D. Venturelli, M. Do, E. Rieffel, and J. Frank, “Compiling quantum circuits to realistic hardware architectures using temporal planners,” Quantum Science and Technology , vol. 3, no. 2, p. 025004, feb 2018. [Online]. Available: https://doi.org/10.1088/2058-9565/aaa331
2058
Closest in time.