Fetching the paper…
Reading the bibliography…
Gate-model quantum computers provide an experimentally implementable architecture for near term quantum computations.
Moore, G. E. Cramming more components onto integrated circuits. Electronics
1965
Earlier work this paper cites.
1995
Earlier work this paper cites.
Gottesman, D., Chuang, I. L. Quantum Teleportation is a Universal Computational Primitive, Nature
1999
Earlier work this paper cites.
Zhou, X., Leung, D. W. and Chuang, I. L. Methodology for quantum logic gate construction, Phys. Rev. A
2000
Earlier work this paper cites.
Vandersypen, L. M. K. et al. Experimental realization of Shor’s quantum factoring algorithm using nuclear magnetic resonance. Nature
2001
Earlier work this paper cites.
Deb, K., Pratap, A., Agarwal, S. and Meyarivan, T. A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. Evol. Comput
2002
Earlier work this paper cites.
Gulde, S. et al. Implementation of the Deutsch-Jozsa algorithm on an ion-trap quantum computer. Nature
2003
Earlier work this paper cites.
Perkowski, M., Lukac, M., Kerntopf, P., Pivtoraiko, M., Folgheraiter, M., Choi, Y. W., Jung-wook, K., Lee, D., Hwangbo, W. and Kim, H. A Hierarchical Approach to Computer-Aided Design of Quantum Circuits. Electrical and Computer Engineering Faculty Publications and Presentations
2003
Earlier work this paper cites.
Lloyd, S., Shapiro, J. H., Wong, F. N. C., Kumar, P., Shahriar, S. M. and Yuen, H. P. Infrastructure for the quantum Internet. ACM SIGCOMM Computer Communication Review
2004
Earlier work this paper cites.
Suman, B. and Kumar, P. A survey of simulated annealing as a tool for single and multiobjective optimization. J. Oper. Res. Soc
2006
Earlier work this paper cites.
Higgins, B. L., Berry, D. W., Bartlett, S. D., Wiseman, H. M. and Pryde, G. J. Entanglement-free Heisenberg-limited phase estimation. Nature
2007
Earlier work this paper cites.
Kimble, H. J. The quantum Internet. Nature
2008
Earlier work this paper cites.
Bandyopadhyay, S., Saha, S., Maulik, U. and Deb, K. A simulated annealing-based multiobjective optimization algorithm: AMOSA, IEEE Trans. Evol. Comput
2008
Earlier work this paper cites.
DiCarlo, L. et al. Demonstration of two-qubit algorithms with a superconducting quantum processor. Nature
2009
Earlier work this paper cites.
Gyongyosi, L. and Imre, S. Advanced Quantum Communications - An Engineering Approach
2012
Earlier work this paper cites.
Jiang, I., Chang, H. Y. and Chang, C. L. WiT: Optimal wiring topology for electromigration avoidance, IEEE Trans. Very Large Scale Integr. Syst
2012
Earlier work this paper cites.
2013
Earlier work this paper cites.
Jamal, L. and Babu, H. M. H. Efficient approaches to design a reversible floating point divider, in 2013 IEEE International Symposium on Circuits and Systems
2013
Earlier work this paper cites.
Amy, M., Maslov, D., Mosca, M. and Roetteler, M. 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
2013
Earlier work this paper cites.
Barends, R. et al. Superconducting quantum circuits at the surface code threshold for fault tolerance. Nature
2014
Cited alongside, same era.
Lloyd, S., Mohseni, M. and Rebentrost, P. Quantum principal component analysis. Nature Physics
2014
Cited alongside, same era.
2014
Cited alongside, same era.
2014
Cited alongside, same era.
Van Meter, R. Quantum Networking
2014
Cited alongside, same era.
2017
Later among the works it cites.
Pirandola, S., Laurenza, R., Ottaviani, C. and Banchi, L. Fundamental limits of repeaterless quantum communications, Nature Communications
2017
Later among the works it cites.
Martins, R., Lourenco, N. and Horta, N. Analog Integrated Circuit Design Automation
2017
Later among the works it cites.
Paler, A., Polian, I., Nemoto, K. and Devitt, S. J. Fault-tolerant, high level quantum circuits: form, compilation and description, Quantum Science and Technology
2017
Later among the works it cites.
Song, C et al. 10-Qubit Entanglement and Parallel Logic Operations with a Superconducting Circuit, Physical Review Letters
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Rocha, F. A. E. R. M., Martins, F., Lourenco, N. C. C. and Horta, N. C. G. Electronic Design Automation of Analog ICs, Combining Gradient Models with Multi-Objective Evolutionary Algorithms
2014
Cited alongside, same era.
Gosset, D., Kliuchnikov, V., Mosca, M. and Russo, V. An algorithm for the t-count, Quantum Information and Computation
2014
Cited alongside, same era.
Martins, R., Lourenco, N. and Horta, N. Multi-objective optimization of analog integrated circuit placement hierarchy in absolute coordinates. Expert Syst. Appl
2015
Cited alongside, same era.
Ofek, N. et al. Extending the lifetime of a quantum bit with error correction in superconducting circuits. Nature
2016
Cited alongside, same era.
Debnath, S. et al. Demonstration of a small programmable quantum computer with atomic qubits. Nature
2016
Cited alongside, same era.
Monz, T. et al. Realization of a scalable Shor algorithm. Science
2016
Cited alongside, same era.
2016
Cited alongside, same era.
Preskill, J. Quantum Computing in the NISQ era and beyond, Quantum
2018
Closest in time.
Gyongyosi, L., Imre, S. and Nguyen, H. V. A Survey on Quantum Channel Capacities, IEEE Communications Surveys and Tutorials
2018
Closest in time.
Gyongyosi, L. and Imre, S. A Survey on Quantum Computing Technology, Computer Science Review
2018
Closest in time.
2018
Closest in time.
Pirandola, S., Braunstein, S.L., Laurenza, R., Ottaviani, C., Cope, T.P.W., Spedalieri, G. and Banchi, L. Theory of channel simulation and bounds for private communication, Quantum Sci. Technol
2018
Closest in time.
2018
Closest in time.
Munoz-Coreas, E. and Thapliyal, H. Quantum Circuit Design of A T-count Optimized Integer Multiplier, IEEE Transactions on Computers
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
Lechner, W. Quantum Approximate Optimization with Parallelizable Gates, arXiv:1802.01157v2
2018
Closest in time.
2018
Closest in time.