Fetching the paper…
Reading the bibliography…
The paradigm behind digital quantum computing inherits the idea of using binary information processing.
Sørensen, Anders, and Klaus Mølmer (1999), “Quantum computation with ions in thermal motion,” Phys. Rev. Lett. 82
1974
Earlier work this paper cites.
Manin, Yu I (1980), “The computable and the non-computable. (Vychislimoe i nevychislimoe),” Kibernetika. Moskva: ”Sovetskoe Radio”. 128 p. R. 0.45 (1980)
1980
Earlier work this paper cites.
Feynman, Richard P (1982), “Simulating physics with computers,” International Journal of Theoretical Physics 21
1982
Earlier work this paper cites.
Deutsch, David (1985), “Quantum theory, the church-turing principle and the universal quantum computer,” Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences 400
1985
Earlier work this paper cites.
Feynman, Richard P (1986), “Quantum mechanical computers,” Foundations of Physics 16
1986
Earlier work this paper cites.
Lloyd, Seth (1993), “A potentially realizable quantum computer,” Science 261
1993
Earlier work this paper cites.
Shor, PW (1994), “Algorithms for quantum computation: discrete logarithms and factoring,” in Proceedings 35th Annual Symposium on Foundations of Computer Science , pp. 124–134
1994
Earlier work this paper cites.
Barenco, Adriano, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter (1995), “Elementary gates for quantum computation,” Phys. Rev. A 52
1995
Earlier work this paper cites.
Cirac, J I, and P. Zoller (1995), “Quantum computations with cold trapped ions,” Phys. Rev. Lett. 74
1995
Earlier work this paper cites.
Monroe, C, D. M. Meekhof, B. E. King, W. M. Itano, and D. J. Wineland (1995), “Demonstration of a fundamental quantum logic gate,” Phys. Rev. Lett. 75
1995
Earlier work this paper cites.
Lloyd, Seth (1996), “Universal quantum simulators,” Science 273
1996
Earlier work this paper cites.
Gottesman, Daniel (1997), “Stabilizer codes and quantum error correction,” arXiv:quant-ph/9705052 [quant-ph]
1997
Earlier work this paper cites.
Grover, Lov K (1997), “Quantum mechanics helps in searching for a needle in a haystack,” Phys. Rev. Lett. 79
1997
Earlier work this paper cites.
Brassard, Gilles, Isaac Chuang, Seth Lloyd, and Christopher Monroe (1998), “Quantum computing,” Proceedings of the National Academy of Sciences 95
1998
Earlier work this paper cites.
Kessel’, A R, and V. L. Ermakov (1999), “Multiqubit spin,” Journal of Experimental and Theoretical Physics Letters 70
1999
Earlier work this paper cites.
Mølmer, Klaus, and Anders Sørensen (1999), “Multiparticle entanglement of hot trapped ions,” Phys. Rev. Lett. 82
1999
Earlier work this paper cites.
Bechmann-Pasquinucci, H, and W. Tittel (2000), “Quantum cryptography using larger alphabets,” Phys. Rev. A 61
2000
Earlier work this paper cites.
DiVincenzo, David P (2000), “The physical implementation of quantum computation,” Fortschritte der Physik 48
2000
Earlier work this paper cites.
Jaksch, D, J. I. Cirac, P. Zoller, S. L. Rolston, R. Côté, and M. D. Lukin (2000), “Fast quantum gates for neutral atoms,” Phys. Rev. Lett. 85
2000
Earlier work this paper cites.
Kessel’, A R, and V. L. Ermakov (2000), “Physical implementation of three-qubit gates on a separate quantum particle,” Journal of Experimental and Theoretical Physics Letters 71
2000
Earlier work this paper cites.
Muthukrishnan, Ashok, and C. R. Stroud (2000), “Multivalued logic gates for quantum computation,” Phys. Rev. A 62
2000
Earlier work this paper cites.
Nielsen, Michael A, and Isaac L. Chuang (2000), Quantum Computation and Quantum Information (Cambridge University Press)
2000
Earlier work this paper cites.
Sørensen, Anders, and Klaus Mølmer (2000), “Entanglement and quantum computation with ions in thermal motion,” Phys. Rev. A 62
2000
Earlier work this paper cites.
Bourennane, Mohamed, Anders Karlsson, and Gunnar Björk (2001), “Quantum key distribution using multilevel encoding,” Phys. Rev. A 64
2001
Earlier work this paper cites.
Leuenberger, Michael N, and Daniel Loss (2001), “Quantum computing in molecular magnets,” Nature 410
2001
Earlier work this paper cites.
Cerf, Nicolas J, Mohamed Bourennane, Anders Karlsson, and Nicolas Gisin (2002), “Security of quantum key distribution using d \mathit{d} -level systems,” Phys. Rev. Lett. 88
2002
Earlier work this paper cites.
Collins, Daniel, Nicolas Gisin, Noah Linden, Serge Massar, and Sandu Popescu (2002), “Bell inequalities for arbitrarily high-dimensional systems,” Phys. Rev. Lett. 88
2002
Earlier work this paper cites.
Kessel, Alexander R, and Natalia M. Yakovleva (2002), “Implementation schemes in nmr of quantum processors and the deutsch-jozsa algorithm by using virtual spin representation,” Phys. Rev. A 66
2002
Earlier work this paper cites.
Shi, Yaoyun (2003), “Both toffoli and controlled-not need little help to do universal quantum computing,” Quantum Info. Comput. 3
2003
Earlier work this paper cites.
Wang, Xiaoguang, Barry C. Sanders, and Dominic W. Berry (2003), “Entangling power and operator entanglement in qudit systems,” Phys. Rev. A 67
2003
Earlier work this paper cites.
Zhou, D L, B. Zeng, Z. Xu, and C. P. Sun (2003), “Quantum computation based on d-level cluster state,” Phys. Rev. A 68
2003
Earlier work this paper cites.
Sych, Denis V, Boris A. Grishanin, and Victor N. Zadkov (2004), “Critical error rate of quantum-key-distribution protocols versus the size and dimensionality of the quantum alphabet,” Phys. Rev. A 70
2004
Earlier work this paper cites.
Ralph, T C, K. J. Resch, and A. Gilchrist (2007), “Efficient toffoli gates using qudits,” Phys. Rev. A 75
2007
Earlier work this paper cites.
Lanyon, B P, T. J. Weinhold, N. K. Langford, J. L. O’Brien, K. J. Resch, A. Gilchrist, and A. G. White (2008), “Manipulating biphotonic qutrits,” Phys. Rev. Lett. 100
2008
Earlier work this paper cites.
Ionicioiu, Radu, Timothy P. Spiller, and William J. Munro (2009), “Generalized toffoli gates using qudit catalysis,” Phys. Rev. A 80
2009
Earlier work this paper cites.
Lanyon, Benjamin P, Marco Barbieri, Marcelo P. Almeida, Thomas Jennewein, Timothy C. Ralph, Kevin J. Resch, Geoff J. Pryde, Jeremy L. O’Brien, Alexei Gilchrist, and Andrew G. White (2009), “Simplifying quantum logic using higher-dimensional hilbert spaces,” Nature Physics 5
2009
Earlier work this paper cites.
Neeley, Matthew, Markus Ansmann, Radoslaw C. Bialczak, Max Hofheinz, Erik Lucero, Aaron D. O’Connell, Daniel Sank, Haohua Wang, James Wenner, Andrew N. Cleland, Michael R. Geller, and John M. Martinis (2009), “Emulation of a quantum spin with a superconducting phase qudit,” Science 325
2009
Earlier work this paper cites.
Ladd, T D, F. Jelezko, R. Laflamme, Y. Nakamura, C. Monroe, and J. L. O’Brien (2010), “Quantum computers,” Nature 464
2010
Earlier work this paper cites.
Vértesi, Tamás, Stefano Pironio, and Nicolas Brunner (2010), “Closing the detection loophole in bell experiments using qudits,” Phys. Rev. Lett. 104
2010
Earlier work this paper cites.
Dada, Adetunmise C, Jonathan Leach, Gerald S Buller, Miles J Padgett, and Erika Andersson (2011), “Experimental high-dimensional two-photon entanglement and violations of generalized bell inequalities,” Nature Physics 7
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
Lapkiewicz, Radek, Peizhe Li, Christoph Schaeff, Nathan K. Langford, Sven Ramelow, Marcin Wieśniak, and Anton Zeilinger (2011), “Experimental non-classicality of an indivisible quantum system,” Nature 474
2011
Earlier work this paper cites.
Parasa, Vamsi, and Marek Perkowski (2011), “Quantum phase estimation using multivalued logic,” in 2011 41st IEEE International Symposium on Multiple-Valued Logic , pp. 224–229
2011
Earlier work this paper cites.
Wei, Tzu-Chieh, Ian Affleck, and Robert Raussendorf (2011), “Affleck-kennedy-lieb-tasaki state on a honeycomb lattice is a universal quantum computational resource,” Phys. Rev. Lett. 106
2011
Earlier work this paper cites.
Fedorov, A, L. Steffen, M. Baur, M. P. da Silva, and A. Wallraff (2012), “Implementation of a toffoli gate with superconducting circuits,” Nature 481
2012
Earlier work this paper cites.
Preskill, John (2012), “Quantum computing and the entanglement frontier,” arXiv:1203.5813 [quant-ph]
2012
Earlier work this paper cites.
Zheng, Shi-Biao (2012), “Simplified construction and physical realization of n n -qubit controlled phase gates,” Phys. Rev. A 86
2012
Earlier work this paper cites.
Devitt, Simon J, William J Munro, and Kae Nemoto (2013), “Quantum error correction for beginners,” Reports on Progress in Physics 76
2013
Earlier work this paper cites.
Saeedi, Mehdi, and Massoud Pedram (2013), “Linear-depth quantum circuits for n-qubit toffoli gates with no ancilla,” Physical Review A 87
2013
Cited alongside, same era.
Campbell, Earl T (2014), “Enhanced fault-tolerant quantum computing in d d -level systems,” Phys. Rev. Lett. 113
2014
Cited alongside, same era.
Markov, Igor L (2014), “Limits on fundamental limits to computation,” Nature 512
2014
Cited alongside, same era.
Anderson, B E, H. Sosa-Martinez, C. A. Riofrío, Ivan H. Deutsch, and Poul S. Jessen (2015), “Accurate and robust unitary transformations of a high-dimensional quantum system,” Phys. Rev. Lett. 114
2015
Cited alongside, same era.
Braumüller, Jochen, Joel Cramer, Steffen Schlör, Hannes Rotzinger, Lucas Radtke, Alexander Lukashenko, Ping Yang, Sebastian T. Skacel, Sebastian Probst, Michael Marthaler, Lingzhen Guo, Alexey V. Ustinov, and Martin Weides (2015), “Multiphoton dressing of an anharmonic superconducting many-level quantum circuit,” Phys. Rev. B 91
Goss, Noah, Alexis Morvan, Brian Marinelli, Bradley K Mitchell, Long B Nguyen, Ravi K Naik, Larry Chen, Christian Jünger, John Mark Kreikebaum, David I Santiago, et al. (2022), “High-fidelity qutrit entangling gates for superconducting circuits,” Nature communications 13
2022
Later among the works it cites.
Graham, T M, Y. Song, J. Scott, C. Poole, L. Phuttitarn, K. Jooya, P. Eichler, X. Jiang, A. Marra, B. Grinkemeyer, M. Kwon, M. Ebert, J. Cherek, M. T. Lichtman, M. Gillette, J. Gilbert, D. Bowman, T. Ballance, C. Campbell, E. D. Dahl, O. Crawford, N. S. Blunt, B. Rogers, T. Noel, and M. Saffman (2022), “Multi-qubit entanglement and algorithms on a neutral-atom quantum computer,” Nature 604
2022
Later among the works it cites.
Hanks, Michael, and M. S. Kim (2022), “Fault tolerance in qudit circuit design,” Phys. Rev. A 106
2022
Later among the works it cites.
Mato, K, M. Ringbauer, S. Hillmich, and R. Wille (2022), “Adaptive compilation of multi-level quantum operations,” in 2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (IEEE Computer Society, Los Alamitos, CA, USA) pp. 484–491
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
Hutter, Adrian, Daniel Loss, and James R Wootton (2015), “Improved hdrg decoders for qudit and non-abelian quantum error correction,” New Journal of Physics 17
2015
Cited alongside, same era.
Mirhosseini, Mohammad, Omar S Magaña-Loaiza, Malcolm N O’Sullivan, Brandon Rodenburg, Mehul Malik, Martin P J Lavery, Miles J Padgett, Daniel J Gauthier, and Robert W Boyd (2015), “High-dimensional quantum cryptography with twisted light,” New Journal of Physics 17
2015
Cited alongside, same era.
Peterer, Michael J, Samuel J. Bader, Xiaoyue Jin, Fei Yan, Archana Kamal, Theodore J. Gudmundsen, Peter J. Leek, Terry P. Orlando, William D. Oliver, and Simon Gustavsson (2015), “Coherence and decay of higher energy levels of a superconducting transmon qubit,” Phys. Rev. Lett. 114
2015
Cited alongside, same era.
Fickler, Robert, Geoff Campbell, Ben Buchler, Ping Koy Lam, and Anton Zeilinger (2016), “Quantum entanglement of angular momentum states with quantum numbers up to 10,010,” Proceedings of the National Academy of Sciences 113
2016
Cited alongside, same era.
Maslov, Dmitri (2016), “Advantages of using relative-phase toffoli gates with an application to multiple control toffoli optimization,” Phys. Rev. A 93
2016
Cited alongside, same era.
Song, Chong, Shi-Lei Su, Jin-Lei Wu, Dong-Yang Wang, Xin Ji, and Shou Zhang (2016), “Generation of tree-type three-dimensional entangled states via adiabatic passage,” Phys. Rev. A 93
2016
Cited alongside, same era.
Bocharov, Alex, Martin Roetteler, and Krysta M. Svore (2017), “Factoring with qutrits: Shor’s algorithm on ternary and metaplectic quantum architectures,” Phys. Rev. A 96
2017
Cited alongside, same era.
2022
Later among the works it cites.
Nikolaeva, A S, E. O. Kiktenko, and A. K. Fedorov (2022), “Decomposing the generalized toffoli gate with qutrits,” Phys. Rev. A 105
2022
Later among the works it cites.
Ringbauer, Martin, Michael Meth, Lukas Postler, Roman Stricker, Rainer Blatt, Philipp Schindler, and Thomas Monz (2022), “A universal qudit quantum processor with trapped ions,” Nature Physics 18
2022
Later among the works it cites.
Saha, Amit, Ritajit Majumdar, Debasri Saha, Amlan Chakrabarti, and Susmita Sur-Kolay (2022), “Asymptotically improved circuit for a d d -ary grover’s algorithm with advanced decomposition of the n n -qudit toffoli gate,” Phys. Rev. A 105
2022
Later among the works it cites.
Weggemans, Jordi R, Alexander Urech, Alexander Rausch, Robert Spreeuw, Richard Boucherie, Florian Schreck, Kareljan Schoutens, Jiří Minář, and Florian Speelman (2022), “Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach,” Quantum 6
2022
Later among the works it cites.
Zhu, Qingling, Sirui Cao, Fusheng Chen, Ming-Cheng Chen, Xiawei Chen, Tung-Hsun Chung, Hui Deng, Yajie Du, Daojin Fan, Ming Gong, Cheng Guo, Chu Guo, Shaojun Guo, Lianchen Han, Linyin Hong, He-Liang Huang, Yong-Heng Huo, Liping Li, Na Li, Shaowei Li, Yuan Li, Futian Liang, Chun Lin, Jin Lin, Haoran Qian, Dan Qiao, Hao Rong, Hong Su, Lihua Sun, Liangyuan Wang, Shiyu Wang, Dachao Wu, Yulin Wu, Yu Xu, Kai Yan, Weifeng Yang, Yang Yang, Yangsen Ye, Jianghan Yin, Chong Ying, Jiale Yu, Chen Zha, Cha Zhang, Haibin Zhang, Kaili Zhang, Yiming Zhang, Han Zhao, Youwei Zhao, Liang Zhou, Chao-Yang Lu, Cheng-Zhi Peng, Xiaobo Zhu, and Jian-Wei Pan (2022), “Quantum computational advantage via 60-qubit 24-cycle random circuit sampling,” Science Bulletin 67
2022
Later among the works it cites.
Aksenov, M A, I. V. Zalivako, I. A. Semerikov, A. S. Borisenko, N. V. Semenin, P. L. Sidorov, A. K. Fedorov, K. Yu. Khabarova, and N. N. Kolachevsky (2023), “Realizing quantum gates with optically addressable yb+ 171 ion qudits,” Phys. Rev. A 107
2023
Closest in time.
2023
Closest in time.
Chiesa, A, S. Roca, S. Chicco, M.C. de Ory, A. Gómez-León, A. Gomez, D. Zueco, F. Luis, and S. Carretta (2023), “Blueprint for a molecular-spin quantum processor,” Phys. Rev. Appl. 19
2023
Closest in time.
Chu, Ji, Xiaoyu He, Yuxuan Zhou, Jiahao Yuan, Libo Zhang, Qihao Guo, Yongju Hai, Zhikun Han, Chang-Kang Hu, Wenhui Huang, et al. (2023), “Scalable algorithm simplification using quantum and logic,” Nature physics 19
2023
Closest in time.
Dalal, Archismita, and Barry C. Sanders (2023), “Two-qubit gate in neutral atoms using transitionless quantum driving,” Phys. Rev. A 107
2023
Closest in time.
Developers, Cirq (2023), “Cirq,”
2023
Closest in time.
2023
Closest in time.
Fischer, Laurin E, Alessandro Chiesa, Francesco Tacchino, Daniel J. Egger, Stefano Carretta, and Ivano Tavernelli (2023), “Universal qudit gate synthesis for transmons,” PRX Quantum 4
2023
Closest in time.
González-Cuadra, D, D. Bluvstein, M. Kalinowski, R. Kaubruegger, N. Maskara, P. Naldesi, T. V. Zache, A. M. Kaufman, M. D. Lukin, H. Pichler, B. Vermersch, Jun Ye, and P. Zoller (2023), “Fermionic quantum processing with programmable neutral atom arrays,” Proceedings of the National Academy of Sciences 120
2023
Closest in time.
2023
Closest in time.
Holland, Connor M, Yukai Lu, and Lawrence W Cheuk (2023), “On-demand entanglement of molecules in a reconfigurable optical tweezer array,” Science 382
2023
Closest in time.
Hrmo, Pavel, Benjamin Wilhelm, Lukas Gerster, Martin W. van Mourik, Marcus Huber, Rainer Blatt, Philipp Schindler, Thomas Monz, and Martin Ringbauer (2023), “Native qudit entanglement in a trapped ion quantum processor,” Nature Communications 14
2023
Closest in time.
2023
Closest in time.
Luo, Kai, Wenhui Huang, Ziyu Tao, Libo Zhang, Yuxuan Zhou, Ji Chu, Wuxin Liu, Biying Wang, Jiangyu Cui, Song Liu, Fei Yan, Man-Hong Yung, Yuanzhen Chen, Tongxing Yan, and Dapeng Yu (2023), “Experimental realization of two qutrits gate with tunable coupling in superconducting circuits,” Phys. Rev. Lett. 130
2023
Closest in time.
Mato, Kevin, Stefan Hillmich, and Robert Wille (2023), “Compression of qubit circuits: Mapping to mixed-dimensional quantum systems,” in 2023 IEEE International Conference on Quantum Software (QSW) (IEEE) pp. 155–161
2023
Closest in time.
2023
Closest in time.
Nikolaeva, Anstasiia S, Evgeniy O. Kiktenko, and Aleksey K. Fedorov (2023), “Generalized toffoli gate decomposition using ququints: Towards realizing grover’s algorithm with qudits,” Entropy 25
2023
Closest in time.
Qiskit contributors, (2023), “Qiskit: An open-source framework for quantum computing,”
2023
Closest in time.
Roy, Tanay, Ziqian Li, Eliot Kapit, and DavidI. Schuster (2023), “Two-qutrit quantum algorithms on a programmable superconducting processor,” Phys. Rev. Appl. 19
2023
Closest in time.
Zache, Torsten V, Daniel González-Cuadra, and Peter Zoller (2023), “Fermion-qudit quantum processors for simulating lattice gauge theories with matter,” Quantum 7
2023
Closest in time.
Zheng, Yun, Chonghao Zhai, Dajian Liu, Jun Mao, Xiaojiong Chen, Tianxiang Dai, Jieshan Huang, Jueming Bao, Zhaorong Fu, Yeyu Tong, et al. (2023), “Multichip multidimensional quantum networks with entanglement retrievability,” Science 381
2023
Closest in time.
Amaro-Alcalá, David, Barry C. Sanders, and Hubert de Guise (2024b), “Qudit non-clifford interleaved benchmarking,” in 2024 IEEE 54th International Symposium on Multiple-Valued Logic (ISMVL) (IEEE) p. 103–108
2024
Closest in time.
2024
Closest in time.
Chiesa, A, P Santini, E Garlatti, F Luis, and S Carretta (2024), “Molecular nanomagnets: a viable path toward quantum information processing?” Reports on Progress in Physics 87
2024
Closest in time.
Fernández de Fuentes, Irene, Tim Botzem, Mark AI Johnson, Arjen Vaartjes, Serwan Asaad, Vincent Mourik, Fay E Hudson, Kohei M Itoh, Brett C Johnson, Alexander M Jakob, et al. (2024), “Navigating the 16-dimensional hilbert space of a high-spin donor qudit with electric and magnetic fields,” Nature communications 15
2024
Closest in time.
Guo, Yuhang, Wentao Ji, Xi Kong, Mengqi Wang, Haoyu Sun, Jingyang Zhou, Zihua Chai, Xing Rong, Fazhan Shi, Ya Wang, and Jiangfeng Du (2024), “Single-shot readout of a solid-state electron spin qutrit,” Phys. Rev. Lett. 132
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
Kazmina, Alena S, Ilia V Zalivako, Alexander S Borisenko, Nikita A Nemkov, Anastasiia S Nikolaeva, Ilya A Simakov, Arina V Kuznetsova, Elena Yu Egorova, Kristina P Galstyan, Nikita V Semenin, et al. (2024), “Demonstration of a parity-time-symmetry-breaking phase transition using superconducting and trapped-ion qutrits,” Physical Review A 109
2024
Closest in time.
Kehrer, Tobias, Tobias Nadolny, and Christoph Bruder (2024), “Improving transmon qudit measurement on ibm quantum hardware,” Phys. Rev. Res. 6
2024
Closest in time.
Nguyen, Long B, Noah Goss, Karthik Siva, Yosep Kim, Ed Younis, Bingcheng Qing, Akel Hashim, David I Santiago, and Irfan Siddiqi (2024), “Empowering a qudit-based quantum processor by traversing the dual bosonic ladder,” Nature Communications 15
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
Zhou, Hengyun, Haoyang Gao, Nathaniel T. Leitao, Oksana Makarova, Iris Cong, Alexander M. Douglas, Leigh S. Martin, and Mikhail D. Lukin (2024), “Robust hamiltonian engineering for interacting qudit systems,” Phys. Rev. X 14
2024
Closest in time.