Fetching the paper…
Reading the bibliography…
A significant hurdle towards realization of practical and scalable quantum computing is to protect the quantum states from inherent noises during the computation.
A. N. Habermann, “Parallel neighbor-sort (or the glory of the induction principle),” 1972
1972
Earlier work this paper cites.
R. Spanke and V. Benes, “N-stage planar optical permutation network,” Applied Optics , vol. 26, no. 7, pp. 1226–1229, 1987
1987
Earlier work this paper cites.
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, “Elementary gates for quantum computation,” Physical review A , vol. 52, no. 5, p. 3457, 1995
1995
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.
M. Nielsen and I. Chuang, Quantum Computation and Quantum Information . Cambridge Univ. Press, 2000
2000
Earlier work this paper cites.
H. Kampermann and W. Veeman, “Quantum computing using quadrupolar spins in solid state nmr,” Quantum Information Processing , vol. 1, no. 5, pp. 327–344, 2002. [Online]. Available: http://dx.doi.org/10.1023/A:1023461628937
2002
Earlier work this paper cites.
A. G. Fowler, C. D. Hill, and L. C. L. Hollenberg, “Quantum-error correction on linear-nearest-neighbor qubit arrays,” Phys. Rev. A , vol. 69, p. 042314, Apr 2004. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevA.69.042314
2004
Earlier work this paper cites.
S. C. Benjamin, A. Ardavan, G. A. D. Briggs, D. A. Britz, D. Gunlycke, J. Jefferson, M. A. G. Jones, D. F. Leigh, B. W. Lovett, A. N. Khlobystov, S. A. Lyon, J. J. L. Morton, K. Porfyrakis, M. R. Sambrook, and A. M. Tyryshkin, “Towards a fullerene-based quantum computer,” Journal of Physics: Condensed Matter , vol. 18, no. 21, p. S867, 2006. [Online]. Available: http://stacks.iop.org/0953-8984/18/i=21/a=S12
2006
Earlier work this paper cites.
M. Whitney, N. Isailovic, Y. Patel, and J. Kubiatowicz, “Automated generation of layout and control for quantum circuits,” in Proceedings of the 4th International Conference on Computing Frontiers , ser. CF ’07, 2007, pp. 83–94
2007
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.
R. Wille, D. Große, L. Teuber, G. W. Dueck, and R. Drechsler, “RevLib: An online resource for reversible functions and reversible circuits,” in Int’l Symp. on Multi-Valued Logic , 2008, pp. 220–225, RevLib is available at http://www.revlib.org
2008
Earlier work this paper cites.
D. Maslov, G. W. Dueck, D. M. Miller, and C. Negrevergne, “Quantum circuit simplification and level compaction,” Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on , vol. 27, no. 3, pp. 436–444, 2008
2008
Earlier work this paper cites.
A. W. Cross, D. P. Divincenzo, and B. M. Terhal, “A comparative code study for quantum fault tolerance,” Quantum Info. Comput. , vol. 9, no. 7, pp. 541–572, Jul. 2009. [Online]. Available: http://dl.acm.org/citation.cfm?id=2011814.2011815
2009
Cited alongside, same era.
D. Leung, J. Oppenheim, and A. Winter, “Quantum network communication - the butterfly and beyond,” IEEE Transactions on Information Theory , vol. 56, no. 7, pp. 3478–3490, 2010
2010
Cited alongside, same era.
2011
Cited alongside, same era.
Y. Hirata, M. Nakanishi, S. Yamashita, and Y. Nakashima, “An efficient conversion of quantum circuits to a linear nearest neighbor architecture,” Quantum Information & Computation , vol. 11, no. 1&2, pp. 142–166, 2011
2011
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 , Jan 2015, pp. 178–183
2015
Later among the works it cites.
A. D. Córcoles, E. Magesan, S. J. Srinivasan, A. W. Cross, M. Steffen, J. M. Gambetta, and J. M. Chow, “Demonstration of a quantum error detection code using a square lattice of four superconducting qubits,” Nature communications , vol. 6, 2015
2015
Later among the works it cites.
A. Lye, R. Wille, and R. Drechsler, “Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits,” in Design Automation Conference (ASP-DAC), 2015 20th Asia and South Pacific . IEEE, 2015, pp. 178–183
2015
Later among the works it cites.
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 ASP Design Automation Conf. , 2016, pp. 292–297
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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
Cited alongside, same era.
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, “Surface codes: Towards practical large-scale quantum computation,” Physical Review A , vol. 86, no. 3, p. 032324, Sep. 2012
2012
Cited alongside, same era.
R. Beals, S. Brierley, O. Gray, A. W. Harrow, S. Kutin, N. Linden, D. Shepherd, and M. Stather, “Efficient distributed quantum computing,” in Proc. R. Soc. A , vol. 469, no. 2153. The Royal Society, 2013, p. 20120686
2013
Cited alongside, same era.
A. Shafaei, M. Saeedi, and M. Pedram, “Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures,” in Proceedings of the 50th Annual Design Automation Conference . ACM, 2013, p. 41
2013
Cited alongside, same era.
A. Shafaei, M. Saeedi, and M. Pedram, “Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits,” in ASP Design Automation Conf. , 2014, pp. 495–500
2014
Cited alongside, same era.
M. M. Rahman, G. W. Dueck, and J. D. Horton, “An algorithm for quantum template matching,” J. Emerg. Technol. Comput. Syst. , vol. 11, no. 3, pp. 31:1–31:20, Dec. 2014. [Online]. Available: http://doi.acm.org/10.1145/2629537
2014
Cited alongside, same era.
2014
Cited alongside, same era.
I. Sau, “Optimal permutation routing on mesh networks.”
Cited in the paper.
2016
Later among the works it cites.
Md. Mazder Rahman, Gerhard W. Dueck, Anupam Chattopadhyay and Robert Wille, “Integrated synthesis of linear nearest neighbor ancilla-free mct circuits,” in Proceedings of the International Symposium on Multiple-Valued Logic , 2016
2016
Later among the works it cites.
L. Biswal, C. Bandyopadhyay, A. Chattopadhyay, R. Wille, R. Drechsler, and H. Rahaman, “Nearest-neighbor and fault-tolerant quantum circuit implementation,” in 2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL) , 2016, pp. 156–161
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
I. Gurobi Optimization, “Gurobi optimizer reference manual,” 2016. [Online]. Available: http://www.gurobi.com
2016
Later among the works it cites.
A. Kole, K. Datta, and I. Sengupta, “A heuristic for linear nearest neighbor realization of quantum circuits by swap gate insertion using n n -gate lookahead,” IEEE Journal on Emerging and Selected Topics in Circuits and Systems , vol. 6, no. 1, pp. 62–72, 2016
2016
Later among the works it cites.
A. Mona and M. Saeedi, “RCViewer+, version 2.5, 2017,” http://ceit.aut.ac.ir/QDA/RCV.htm
2017
Closest in time.