Fetching the paper…
Reading the bibliography…
The current phase of quantum computing is in the Noisy Intermediate-Scale Quantum (NISQ) era.
D. P. DiVincenzo, “Two-bit gates are universal for quantum computation,” Physical Review A , vol. 51, no. 2, p. 1015, 1995
1995
Earlier work this paper cites.
R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca, “Quantum algorithms revisited,” Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences , vol. 454, no. 1969, pp. 339–354, 1998
1998
Earlier work this paper cites.
P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM review , vol. 41, no. 2, pp. 303–332, 1999
1999
Earlier work this paper cites.
R. Jozsa, “Quantum factoring, discrete logarithms, and the hidden subgroup problem,” Computing in science & engineering , vol. 3, no. 2, p. 34, 2001
2001
Earlier work this paper cites.
M. A. Nielsen and I. Chuang, “Quantum computation and quantum information,” 2002
2002
Earlier work this paper cites.
S. A. Cuccaro, T. G. Draper, S. A. Kutin, and D. P. Moulton, “A new quantum ripple-carry addition circuit,” arXiv preprint quant-ph/0410184 , 2004
2004
Earlier work this paper cites.
C. M. Dawson and M. A. Nielsen, “The solovay-kitaev algorithm,” arXiv preprint quant-ph/0505030 , 2005
2005
Earlier work this paper cites.
R. R. Tucci, “An introduction to cartan’s kak decomposition for qc programmers,” arXiv preprint quant-ph/0507171 , 2005
2005
Earlier work this paper cites.
A. B. Nagy, “On an implementation of the solovay-kitaev algorithm,” arXiv preprint quant-ph/0606077 , 2006
2006
Earlier work this paper cites.
V. V. Shende, S. S. Bullock, and I. L. Markov, “Synthesis of quantum-logic circuits,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems , vol. 25, no. 6, pp. 1000–1010, 2006
2006
Earlier work this paper cites.
D. Maslov, S. M. Falconer, and M. Mosca, “Quantum circuit placement,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems , vol. 27, no. 4, pp. 752–763, 2008
2008
Earlier work this paper cites.
D. Große, R. Wille, G. W. Dueck, and R. Drechsler, “Exact multiple-control toffoli network synthesis with sat techniques,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems , vol. 28, no. 5, pp. 703–715, 2009
2009
Earlier work this paper cites.
2011
Earlier work this paper cites.
M. Saeedi, R. Wille, and R. Drechsler, “Synthesis of quantum circuits for linear nearest neighbor architectures,” Quantum Information Processing , vol. 10, no. 3, pp. 355–377, 2011
2011
Earlier work this paper cites.
2012
Earlier work this paper cites.
M. Amy, D. Maslov, M. Mosca, and M. Roetteler, “A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems , vol. 32, no. 6, pp. 818–830, 2013
2013
Earlier work this paper cites.
B. Giles and P. Selinger, “Exact synthesis of multiqubit clifford+ t circuits,” Physical Review A , vol. 87, no. 3, p. 032332, 2013
2013
Earlier work this paper cites.
M. Heyl, A. Polkovnikov, and S. Kehrein, “Dynamical quantum phase transitions in the transverse-field ising model,” Physical review letters , vol. 110, no. 13, p. 135704, 2013
2013
Earlier work this paper cites.
M. AlFailakawi, I. Ahmad, and S. Hamdan, “Lnn reversible circuit realization using fast harmony search based heuristic,” in Asia-Pacific Conference on Computer Science and Electrical Engineering , 2014
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’brien, “A variational eigenvalue solver on a photonic quantum processor,” Nature Communications , vol. 5, p. 4213, 2014
2014
Earlier work this paper cites.
R. Wille, A. Lye, and R. Drechsler, “Optimal SWAP gate insertion for nearest neighbor quantum circuits,” in 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC) . IEEE, 2014, pp. 489–494
2014
Earlier work this paper cites.
O. Al-Ta’ani, “Quantum circuit synthesis using solovay-kitaev algorithm and optimization techniques,” Ph.D. dissertation, Kansas State University, 2015
2015
Earlier work this paper cites.
T. Bahreini and N. Mohammadzadeh, “An MINLP model for scheduling and placement of quantum circuits with a heuristic solution approach,” ACM Journal on Emerging Technologies in Computing Systems (JETC) , vol. 12, no. 3, pp. 1–20, 2015
2015
Earlier work this paper cites.
A. Bocharov, M. Roetteler, and K. M. Svore, “Efficient synthesis of universal repeat-until-success quantum circuits,” Physical review letters , vol. 114, no. 8, p. 080502, 2015
2015
Cited alongside, same era.
S. J. Glaser, U. Boscain, T. Calarco, C. P. Koch, W. Köckenberger, R. Kosloff, I. Kuprov, B. Luy, S. Schirmer, T. Schulte-Herbrüggen et al. , “Training schrödinger’s cat: quantum optimal control,” The European Physical Journal D , vol. 69, no. 12, pp. 1–24, 2015
2015
Cited alongside, same era.
A. JavadiAbhari, S. Patil, D. Kudrow, J. Heckey, A. Lvov, F. T. Chong, and M. Martonosi, “ScaffCC: Scalable compilation and analysis of quantum programs,” Parallel Computing , vol. 45, pp. 2–17, 2015
2015
Cited alongside, same era.
A. Lye, R. Wille, and R. Drechsler, “Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits,” in The 20th Asia and South Pacific Design Automation Conference . IEEE, 2015, pp. 178–183
2015
Cited alongside, same era.
G. Aleksandrowicz, T. Alexander, P. Barkoutsos, L. Bello, Y. Ben-Haim, D. Bucher, F. Cabrera-Hernández, J. Carballo-Franquis, A. Chen, C. Chen et al. , “Qiskit: An open-source framework for quantum computing,” Accessed on: Mar , vol. 16, 2019
2019
Later among the works it cites.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell et al. , “Quantum supremacy using a programmable superconducting processor,” Nature , vol. 574, no. 7779, pp. 505–510, 2019
2019
Later among the works it cites.
C. Bădescu, R. O’Donnell, and J. Wright, “Quantum state certification,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , 2019, pp. 503–514
2019
Later among the works it cites.
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. De Vos and S. De Baerdemacker, “Block-z x z synthesis of an arbitrary quantum circuit,” Physical Review A , vol. 94, no. 5, p. 052317, 2016
2016
Cited alongside, same era.
O. Di Matteo and M. Mosca, “Parallelizing quantum circuit synthesis,” Quantum Science and Technology , vol. 1, no. 1, p. 015003, 2016
2016
Cited alongside, same era.
A. Kole, K. Datta, and I. Sengupta, “A heuristic for linear nearest neighbor realization of quantum circuits by SWAP gate insertion using N-gate lookahead,” IEEE Journal on Emerging and Selected Topics in Circuits and Systems , vol. 6, no. 1, pp. 62–72, 2016
2016
Cited alongside, same era.
E. A. Martinez, T. Monz, D. Nigg, P. Schindler, and R. Blatt, “Compiling quantum algorithms for architectures with multi-qubit gates,” New Journal of Physics , vol. 18, no. 6, p. 063029, 2016
2016
Cited alongside, same era.
R. Wille, O. Keszocze, M. Walter, P. Rohrs, A. Chattopadhyay, and R. Drechsler, “Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits,” in 2016 21st Asia and South Pacific Design Automation Conference (ASP-DAC) . IEEE, 2016, pp. 292–297
2016
Cited alongside, same era.
J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, “Quantum machine learning,” Nature , vol. 549, no. 7671, p. 195, 2017
2017
Cited alongside, same era.
A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, “Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets,” Nature , vol. 549, no. 7671, p. 242, 2017
2017
Cited alongside, same era.
A. P. Lund, M. J. Bremner, and T. C. Ralph, “Quantum sampling problems, bosonsampling and quantum supremacy,” npj Quantum Information , vol. 3, no. 1, pp. 1–8, 2017
2017
Cited alongside, same era.
P. Gokhale, Y. Ding, T. Propson, C. Winkler, N. Leung, Y. Shi, D. I. Schuster, H. Hoffmann, and F. T. Chong, “Partial compilation of variational algorithms for noisy intermediate-scale quantum machines,” in Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture , 2019, pp. 266–278
2019
Later among the works it cites.
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 , 2019, pp. 1001–1014
2019
Later among the works it cites.
2019
Later among the works it cites.
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,” in Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems , 2019, pp. 1031–1044
2019
Later among the works it cites.
R. Wille, M. Haghparast, S. Adarsh, and M. Tanmay, “Towards hdl-based synthesis of reversible circuits with no additional lines,” in 2019 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) . IEEE, 2019, pp. 1–7
2019
Later among the works it cites.
C. Bandyopadhyay, R. Wille, R. Drechsler, and H. Rahaman, “Post synthesis-optimization of reversible circuit using template matching,” in 2020 24th International Symposium on VLSI Design and Test (VDAT) . IEEE, 2020, pp. 1–4
2020
Closest in time.
D. Camps and R. Van Beeumen, “Approximate quantum circuit synthesis using block encodings,” Physical Review A , vol. 102, no. 5, p. 052411, 2020
2020
Closest in time.
J. Cheng, H. Deng, and X. Qian, “Accqoc: Accelerating quantum optimal control based pulse generation,” in 47th ACM/IEEE Annual International Symposium on Computer Architecture, ISCA 2020, Valencia, Spain, May 30 - June 3, 2020 . IEEE, 2020, pp. 543–555. [Online]. Available: https://doi.org/10.1109/ISCA45697.2020.00052
2020
Closest in time.
M. G. Davis, E. Smith, A. Tudor, K. Sen, I. Siddiqi, and C. Iancu, “Towards optimal topology aware quantum circuit synthesis,” in 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) , 2020, pp. 223–234
2020
Closest in time.
Y. Ding, X.-C. Wu, A. Holmes, A. Wiseth, D. Franklin, M. Martonosi, and F. T. Chong, “Square: Strategic quantum ancilla reuse for modular quantum programs via cost-effective uncomputation,” in ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA) , 2020
2020
Closest in time.
2020
Closest in time.
“A Preview of Bristlecone, Google’s New Quantum Processor,” https://ai.googleblog.com/2018/03/a-preview-of-bristlecone-googles-new.html
2020
Closest in time.
“IBM Announces Advances to IBM Quantum Systems and Ecosystem,” https://www-03.ibm.com/press/us/en/pressrelease/53374.wss
2020
Closest in time.
“IBM Quantum Experience,” https://quantum-computing.ibm.com/
2020
Closest in time.
T. Itoko, R. Raymond, T. Imamichi, and A. Matsuo, “Optimization of quantum circuit mapping using gate transformation and commutation,” Integration , vol. 70, pp. 43–50, 2020
2020
Closest in time.
P. Niemann, R. Wille, and R. Drechsler, “Advanced exact synthesis of clifford+ t circuits,” Quantum Information Processing , vol. 19, no. 9, pp. 1–23, 2020
2020
Closest in time.
S. Sivarajah, S. Dilkes, A. Cowtan, W. Simmons, A. Edgington, and R. Duncan, “t— ket¿: A retargetable compiler for nisq devices,” Quantum Science and Technology , 2020
2020
Closest in time.
X.-C. Wu, D. M. Debroy, Y. Ding, J. M. Baker, Y. Alexeev, K. R. Brown, and F. T. Chong, “Tilt: Achieving higher fidelity on a trapped-ion linear-tape quantum computing architecture,” 2020
2020
Closest in time.