Fetching the paper…
Reading the bibliography…
Qudit is a multi-level computational unit alternative to the conventional 2-level qubit.
Dordrecht: Springer Netherlands, 1975
S. Kochen and E. P. Specker, The Problem of Hidden Variables in Quantum Mechanics · 1975
Earlier work this paper cites.
D. Deutsch, “Quantum theory, the Church–Turing principle and the universal quantum computer,” J. Phys. A
1985
Earlier work this paper cites.
J. Patera and H. Zassenhaus, “The Pauli matrices in n dimensions and finest gradings of simple lie algebras of type A n- 1,” J. Math. Phys
1988
Earlier work this paper cites.
Elsevier, 1988
F. A. Bovey, P. A. Mirau, and H. Gutowsky, Nuclear magnetic resonance spectroscopy · 1988
Earlier work this paper cites.
D. P. Deutsch and R. Jozsa, “Rapid solution of problems by quantum computation,” Proc. Royal Soc. Lond. A
1992
Earlier work this paper cites.
M. Reck, A. Zeilinger, H. J. Bernstein, and P. Bertani, “Experimental realization of any discrete unitary operator,” Phys. Rev. Lett
1994
Earlier work this paper cites.
P. W. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” in Proceedings 35th Annual Symposium on Foundations of Computer Science
1994
Earlier work this paper cites.
A. B. Finnila, M. A. Gomez, C. Sebenik, C. Stenson, and J. D. Doll, “Quantum annealing: A new method for minimizing multidimensional functions,” Chem. Phys. Lett
1994
Earlier work this paper cites.
D. P. DiVincenzo, “Two-bit gates are universal for quantum computation,” Phys. Rev. A
1995
Earlier work this paper cites.
E. Bernstein and U. Vazirani, “Quantum complexity theory,” SIAM Journal on Computing
1997
Earlier work this paper cites.
D. Gottesman, “Theory of fault-tolerant quantum computation,” Phys. Rev. A
1998
Earlier work this paper cites.
D. G. Cory, M. D. Price, W. Maas, E. Knill, R. Laflamme, W. H. Zurek, T. F. Havel, and S. S. Somaroo, “Experimental quantum error correction,” Phys. Rev. Lett
1998
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
1998
Earlier work this paper cites.
T. Kadowaki and H. Nishimori, “Quantum annealing in the transverse ising model,” Phys. Rev. E
1998
Earlier work this paper cites.
D. Loss and D. P. DiVincenzo, “Quantum computation with quantum dots,” Phys. Rev. A
1998
Earlier work this paper cites.
I. L. Chuang, L. M. Vandersypen, X. Zhou, D. W. Leung, and S. Lloyd, “Experimental realization of a quantum algorithm,” Nature
1998
Earlier work this paper cites.
D. Gottesman, “Fault-tolerant computation with higher-dimensional systems,” in Lecture Notes in Computer Science
1999
Earlier work this paper cites.
D. J. Rowe, B. C. Sanders, and H. de Guise, “Representations of the Weyl group and Wigner functions for SU(3),” J. Math. Phys
1999
Earlier work this paper cites.
D. Gottesman and I. L. Chuang, “Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations,” Nature
1999
Earlier work this paper cites.
D. S. Abrams and S. Lloyd, “Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors,” Phys. Rev. Lett
1999
Earlier work this paper cites.
P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM review
1999
Earlier work this paper cites.
A. Muthukrishnan and C. R. Stroud, “Multivalued logic gates for quantum computation,” Phys. Rev. A
2000
Earlier work this paper cites.
P. Boykin, T. Mor, M. Pulver, V. Roychowdhury, and F. Vatan, “A new universal and fault-tolerant quantum basis,” Inf. Process. Lett
2000
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, “Quantum computation by adiabatic evolution,” arXiv:quant-ph/0001106
2000
Earlier work this paper cites.
M. N. Leuenberger and D. Loss, “Quantum computing in molecular magnets,” Nature
2001
Earlier work this paper cites.
D. Gottesman, A. Kitaev, and J. Preskill, “Encoding a qubit in an oscillator,” Phys. Rev. A
2001
Earlier work this paper cites.
A. M. Childs, “Secure assisted quantum computation,” arXiv:quant-ph/0111046
2001
Earlier work this paper cites.
N. D. Mermin, “From classical state swapping to quantum teleportation,” Phys. Rev. A
2001
Earlier work this paper cites.
X. Wang, “Continuous-variable and hybrid quantum gates,” J. Phys. A
2001
Earlier work this paper cites.
G. Alber, A. Delgado, N. Gisin, and I. Jex, “Efficient bipartite quantum state purification in arbitrary dimensional Hilbert spaces,” J. Phys. A
2001
Earlier work this paper cites.
E. Dennis, “Toward fault-tolerant quantum computation without concatenation,” Phys. Rev. A
2001
Earlier work this paper cites.
R. Raussendorf and H. J. Briegel, “A one-way quantum computer,” Phys. Rev. Lett
2001
Earlier work this paper cites.
H. J. Briegel and R. Raussendorf, “Persistent entanglement in arrays of interacting particles,” Phys. Rev. Lett
2001
Earlier work this paper cites.
L. M. Vandersypen, M. Steffen, G. Breyta, C. S. Yannoni, M. H. Sherwood, and I. L. Chuang, “Experimental realization of Shor’s quantum factoring algorithm using nuclear magnetic resonance,” Nature
2001
Earlier work this paper cites.
J.-L. Brylinski and R. Brylinski, “Universal quantum gates,” in Mathematics of quantum computation
2002
Earlier work this paper cites.
S. D. Bartlett, H. de Guise, and B. C. Sanders, “Quantum encodings in spin systems and harmonic oscillators,” Phys. Rev. A
2002
Earlier work this paper cites.
A. Y. Vlasov, “Noncommutative tori and universal sets of nonbinary quantum gates,” J. Math. Phys
2002
Earlier work this paper cites.
M. A. Nielsen, M. J. Bremner, J. L. Dodd, A. M. Childs, and C. M. Dawson, “Universal simulation of hamiltonian dynamics for quantum systems with finite-dimensional state spaces,” Phys. Rev. A
2002
Earlier work this paper cites.
A. M. C. R. Stroud, “Quantum fast fourier transform using multilevel atoms,” J. Mod. Opt
2002
Earlier work this paper cites.
Y. Shi, “Both Toffoli and controlled-NOT need little help to do universal quantum computation,” arXiv preprint quant-ph/0205115
2002
Earlier work this paper cites.
A. R. Kessel and N. M. Yakovleva, “Implementation schemes in NMR of quantum processors and the Deutsch-Jozsa algorithm by using virtual spin representation,” Phys. Rev. A
2002
Earlier work this paper cites.
D. Coppersmith, “An approximate Fourier transform useful in quantum factoring,” arXiv preprint quant-ph/0201067
2002
Earlier work this paper cites.
M. H. Freedman, M. Larsen, and Z. Wang, “A modular functor which is universal¶for quantum computation,” Commun. Math. Phys
2002
Earlier work this paper cites.
A. B. Klimov, R. Guzmán, J. C. Retamal, and C. Saavedra, “Qutrit quantum computer with trapped ions,” Phys. Rev. A
2003
Earlier work this paper cites.
J. Daboul, X. Wang, and B. C. Sanders, “Quantum gates on hybrid qudits,” J. Phys. A
2003
Earlier work this paper cites.
D. L. Zhou, B. Zeng, Z. Xu, and C. P. Sun, “Quantum computation based on d-level cluster state,” Phys. Rev. A
2003
Earlier work this paper cites.
K. Fujii, “Exchange gate on the qudit space and fock space,” J. Opt. B
2003
Earlier work this paper cites.
A. Kitaev, “Fault-tolerant quantum computation by anyons,” Ann. Phys. (N. Y.)
2003
Earlier work this paper cites.
I. Chiorescu, Y. Nakamura, C. J. P. M. Harmans, and J. E. Mooij, “Coherent quantum dynamics of a superconducting flux qubit,” Science
2003
Earlier work this paper cites.
N. Ishikawa, M. Sugita, T. Okubo, N. Tanaka, T. Iino, and Y. Kaizu, “Determination of ligand-field parameters and f-electronic structures of double-decker bis (phthalocyaninato) lanthanide complexes,” Inorganic chemistry
2003
Earlier work this paper cites.
M. Hein, J. Eisert, and H. J. Briegel, “Multiparty entanglement in graph states,” Phys. Rev. A
2004
Earlier work this paper cites.
F. Jelezko, T. Gaebel, I. Popa, M. Domhan, A. Gruber, and J. Wrachtrup, “Observation of coherent oscillation of a single nuclear spin and realization of a two-qubit conditional quantum gate,” Phys. Rev. Lett
2004
Earlier work this paper cites.
S. S. Bullock, D. P. O’Leary, and G. K. Brennen, “Asymptotically optimal quantum circuits for d d -level systems,” Phys. Rev. Lett
2005
Earlier work this paper cites.
G. K. Brennen, D. P. O’Leary, and S. S. Bullock, “Criteria for exact qudit universality,” Phys. Rev. A
2005
Earlier work this paper cites.
A. Aspuru-Guzik, A. D. Dutoi, P. J. Love, and M. Head-Gordon, “Simulated quantum computation of molecular energies,” Science
2005
Earlier work this paper cites.
M. A. Nielsen, “A geometric approach to quantum circuit lower bounds,” arXiv preprint quant-ph/0502070
2005
Cited alongside, same era.
D. Mc Hugh and J. Twamley, “Trapped-ion qutrit spin molecule quantum computer,” New J. Phys
2005
Cited alongside, same era.
F. S. Khan and M. Perkowski, “Synthesis of multi-qudit hybrid and d-valued quantum logic circuits by decomposition,” Theor. Comput. Sci
2006
Cited alongside, same era.
M. A. Nielsen, M. R. Dowling, M. Gu, and A. C. Doherty, “Quantum computation as geometry,” Science
2006
Cited alongside, same era.
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
2006
Cited alongside, same era.
B. Mischuck and K. Mølmer, “Qudit quantum computation in the Jaynes-Cummings model,” Phys. Rev. A
2013
Later among the works it cites.
Y.-M. Di and H.-R. Wei, “Synthesis of multivalued quantum logic circuits by elementary gates,” Phys. Rev. A
2013
Later among the works it cites.
M. Van den Nest, “Universal quantum computation with little entanglement,” Phys. Rev. Lett
2013
Later among the works it cites.
2013
Later among the works it cites.
P. C. Humphreys, B. J. Metcalf, J. B. Spring, M. Moore, X.-M. Jin, M. Barbieri, W. S. Kolthammer, and I. A. Walmsley, “Linear optical quantum computing in a single spatial mode,” Phys. Rev. Lett
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. S. Kyoseva and N. V. Vitanov, “Coherent pulsed excitation of degenerate multistate systems: Exact analytic solutions,” Phys. Rev. A
2006
Cited alongside, same era.
M. A. Nielsen, “Cluster-state quantum computation,” Rep. Math. Phys
2006
Cited alongside, same era.
L. Childress, M. V. Gurudev Dutt, J. M. Taylor, A. S. Zibrov, F. Jelezko, J. Wrachtrup, P. R. Hemmer, and M. D. Lukin, “Coherent dynamics of coupled electron and nuclear spin qubits in diamond,” Science
2006
Cited alongside, same era.
J.-S. Lee and A. K. Khitrin, “Projective measurement in nuclear magnetic resonance,” Appl. Phys. Lett
2006
Cited alongside, same era.
T. C. Ralph, K. J. Resch, and A. Gilchrist, “Efficient Toffoli gates using qudits,” Phys. Rev. A
2007
Cited alongside, same era.
B. Zeng, H. Chung, A. W. Cross, and I. L. Chuang, “Local unitary versus local Clifford equivalence of stabilizer and graph states,” Phys. Rev. A
2007
Cited alongside, same era.
Y. Fan, “A generalization of the Deutsch-Jozsa algorithm to multi-valued quantum logic,” in 37th International Symposium on Multiple-Valued Logic (ISMVL’07)
2007
Cited alongside, same era.
Springer Science & Business Media, 2013
C. P. Slichter, Principles of magnetic resonance · 2013
Later among the works it cites.
M. Ganzhorn, S. Klyatskaya, M. Ruben, and W. Wernsdorfer, “Strong spin–phonon coupling between a single-molecule magnet and a carbon nanotube nanoelectromechanical system,” Nat. Nanotechnol
2013
Later among the works it cites.
M. Luo and X. Wang, “Universal quantum computation with qudits,” Science China Physics, Mechanics & Astronomy
2014
Later among the works it cites.
M.-X. Luo, X.-B. Chen, Y.-X. Yang, and X. Wang, “Geometry of quantum computation with qudits,” Sci. Rep
2014
Later among the works it cites.
S. Dogra, Arvind, and K. Dorai, “Determining the parity of a permutation using an experimental nmr qutrit,” Phys. Lett. A
2014
Later among the works it cites.
J. Pan, Y. Cao, X. Yao, Z. Li, C. Ju, H. Chen, X. Peng, S. Kais, and J. Du, “Experimental realization of quantum algorithm for solving linear systems of equations,” Phys. Rev. A
2014
Later among the works it cites.
S. Kais, “Introduction to quantum information and computation for chemistry,” Quantum Inf. Comput. Chem
2014
Later among the works it cites.
R. Barends, J. Kelly, A. Megrant, A. Veitia, D. Sank, E. Jeffrey, T. C. White, J. Mutus, A. G. Fowler, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, C. Neill, P. O’Malley, P. Roushan, A. Vainsencher, J. Wenner, A. N. Korotkov, A. N. Cleland, and J. M. Martinis, “Superconducting quantum circuits at the surface code threshold for fault tolerance,” Nature
2014
Later among the works it cites.
J. M. Martinis and M. R. Geller, “Fast adiabatic qubit gates using only σ z {\sigma}_{z} control,” Phys. Rev. A
2014
Later among the works it cites.
S. Thiele, F. Balestro, R. Ballou, S. Klyatskaya, M. Ruben, and W. Wernsdorfer, “Electrically driven nuclear spin resonance in single-molecule magnets,” Science
2014
Later among the works it cites.
D. M. Reich, G. Gualdi, and C. P. Koch, “Optimal qudit operator bases for efficient characterization of quantum gates,” J. Phys. A-Math Theor
2014
Later among the works it cites.
G. Gualdi, D. Licht, D. M. Reich, and C. P. Koch, “Efficient monte carlo characterization of quantum operations for qudits,” Phys. Rev. A
2014
Later among the works it cites.
S. X. Cui and Z. Wang, “Universal quantum computation with metaplectic anyons,” J. Math. Phys
2015
Later among the works it cites.
S. X. Cui, S.-M. Hong, and Z. Wang, “Universal quantum computation with weakly integral anyons,” Quantum Information Processing
2015
Later among the works it cites.
X. Zhan, J. Li, H. Qin, Z. hao Bian, and P. Xue, “Linear optical demonstration of quantum speed-up with a single qudit,” Opt. Express
2015
Later among the works it cites.
E. Kiktenko, A. Fedorov, A. Strakhov, and V. Man’ko, “Single qudit realization of the Deutsch algorithm using superconducting many-level quantum circuits,” Phys. Lett. A
2015
Later among the works it cites.
E. Zahedinejad, J. Ghosh, and B. C. Sanders, “High-fidelity single-shot Toffoli gate via quantum control,” Phys. Rev. Lett
2015
Later among the works it cites.
A. Bocharov, S. X. Cui, M. Roetteler, and K. M. Svore, “Improved quantum ternary arithmetic,” Quantum Info. Comput
2016
Later among the works it cites.
M. R. A. Adcock, P. Høyer, and B. C. Sanders, “Quantum computation with coherent spin states and the close Hadamard problem,” Quantum Inf. Process
2016
Later among the works it cites.
Z. Webb, “The Clifford group forms a unitary 3-design,” Quantum Inf. Comput
2016
Later among the works it cites.
2016
Later among the works it cites.
H. S. Tonchev and N. V. Vitanov, “Quantum phase estimation and quantum counting with qudits,” Phys. Rev. A
2016
Later among the works it cites.
E. Zahedinejad, J. Ghosh, and B. C. Sanders, “Designing high-fidelity single-shot three-qubit gates: A machine-learning approach,” Phys. Rev. Applied
2016
Later among the works it cites.
A. Hutter and D. Loss, “Quantum computing with parafermions,” Phys. Rev. B
2016
Later among the works it cites.
E. Moreno Pineda, T. Komeda, K. Katoh, M. Yamashita, and M. Ruben, “Surface confinement of TbPc2-SMMs: structural, electronic and magnetic properties,” Dalton Trans
2016
Later among the works it cites.
A. Bocharov, M. Roetteler, and K. M. Svore, “Factoring with qutrits: Shor’s algorithm on ternary and metaplectic quantum architectures,” Phys. Rev. A
2017
Later among the works it cites.
A. Babazadeh, M. Erhard, F. Wang, M. Malik, R. Nouroozi, M. Krenn, and A. Zeilinger, “High-dimensional single-photon quantum gates: Concepts and experiments,” Phys. Rev. Lett
2017
Later among the works it cites.
M. Kues, C. Reimer, P. Roztocki, L. Romero Cortés, S. Sciara, B. Wetzel, Y. Zhang, A. Cino, S. T. Chu, B. E. Little, D. J. Moss, L. Caspani, J. Azaña, and R. Morandotti, “On-chip generation of high-dimensional entangled quantum states and their coherent control,” Nature
2017
Later among the works it cites.
N. T. Islam, C. C. W. Lim, C. Cahall, J. Kim, and D. J. Gauthier, “Provably secure and high-rate quantum key distribution with time-bin qudits,” Sci. Adv
2017
Later among the works it cites.
C. Godfrin, A. Ferhat, R. Ballou, S. Klyatskaya, M. Ruben, W. Wernsdorfer, and F. Balestro, “Operating quantum states in single magnetic molecules: implementation of grover’s quantum algorithm,” Phys. Rev. Lett
2017
Later among the works it cites.
E. Moreno-Pineda, C. Godfrin, F. Balestro, W. Wernsdorfer, and M. Ruben, “Molecular spin qudits for quantum algorithms,” Chem. Soc. Rev
2018
Later among the works it cites.
M. Erhard, R. Fickler, M. Krenn, and A. Zeilinger, “Twisted photons: new quantum perspectives in high dimensions,” Light Sci. Appl
2018
Later among the works it cites.
H.-H. Lu, J. M. Lukens, N. A. Peters, O. D. Odele, D. E. Leaird, A. M. Weiner, and P. Lougovski, “Electro-optic frequency beam splitters and tritters for high-fidelity photonic quantum inf. process.,” Phys. Rev. Lett
2018
Later among the works it cites.
P. Imany, J. A. Jaramillo-Villegas, O. D. Odele, K. Han, D. E. Leaird, J. M. Lukens, P. Lougovski, M. Qi, and A. M. Weiner, “50-ghz-spaced comb of high-dimensional frequency-bin entangled photons from an on-chip silicon nitride microresonator,” Opt. Express
2018
Later among the works it cites.
H.-H. Lu, Z. Hu, M. S. Alshaykh, A. J. Moore, Y. Wang, P. Imany, A. M. Weiner, and S. Kais, “Quantum phase estimation with time-frequency qudits in a single photon,” Adv. Quantum Technol
2019
Later among the works it cites.
D. M. Nguyen and S. Kim, “Quantum key distribution protocol based on modified generalization of Deutsch-Jozsa algorithm in d-level quantum system,” Int. J. Theor. Phys
2019
Later among the works it cites.
T. Bian, D. Murphy, R. Xia, A. Daskin, and S. Kais, “Quantum computing methods for electronic states of the water molecule,” Mol. Phys
2019
Later among the works it cites.
J. Joo, C.-W. Lee, S. Kono, and J. Kim, “Logical measurement-based quantum computation in circuit-qed,” Sci. Rep
2019
Later among the works it cites.
A. Dua, B. Malomed, M. Cheng, and L. Jiang, “Universal quantum computing with parafermions assisted by a half-fluxon,” Phys. Rev. B
2019
Later among the works it cites.
P. Imany, J. A. Jaramillo-Villegas, M. S. Alshaykh, J. M. Lukens, O. D. Odele, A. J. Moore, D. E. Leaird, M. Qi, and A. M. Weiner, “High-dimensional optical quantum logic in large operational spaces,” npj Quantum Inf
2019
Later among the works it cites.
D. Cozzolino, B. Da Lio, D. Bacco, and L. K. Oxenløwe, “High-dimensional quantum communication: Benefits, progress, and future challenges,” Adv. Quantum Technol
2019
Later among the works it cites.
S. Ecker, F. Bouchard, L. Bulla, F. Brandt, O. Kohout, F. Steinlechner, R. Fickler, M. Malik, Y. Guryanova, R. Ursin, et al
2019
Later among the works it cites.
X. Gao, M. Erhard, A. Zeilinger, and M. Krenn, “Computer-inspired concept for high-dimensional multipartite quantum gates,” Phys. Rev. Lett
2020
Closest in time.
E. O. Kiktenko, A. S. Nikolaeva, P. Xu, G. V. Shlyapnikov, and A. K. Fedorov, “Scalable quantum computing with qudits on a graph,” Phys. Rev. A
2020
Closest in time.
K. Nagata, H. Geurdes, S. K. Patro, S. Heidari, A. Farouk, and T. Nakamura, “Generalization of the Bernstein–Vazirani algorithm beyond qubit systems,” Quantum Stud.: Math. Found
2020
Closest in time.
S. Watabe, Y. Seki, and S. Kawabata, “Enhancing quantum annealing performance by a degenerate two-level system,” Sci. Rep
2020
Closest in time.
M. Jafarzadeh, Y.-D. Wu, Y. R. Sanders, and B. C. Sanders, “Randomized benchmarking for qudit Clifford gates,” New J. Phys
2020
Closest in time.
2020
Closest in time.