А. Ю. Китаев, “Квантовые вычисления: алгоритмы и исправление ошибок”, УМН, 52:6(318) (1997), 53–112; Russian Math. Surveys, 52:6 (1997), 1191

RUS ENG

ЖУРНАЛЫ ПЕРСОНАЛИИ ОРГАНИЗАЦИИ КОНФЕРЕНЦИИ СЕМИНАРЫ ВИДЕОТЕКА ЛИЧНЫЙ КАБИНЕТ

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	Общая информация
	Последний выпуск
	Архив
	Импакт-фактор
	Правила для авторов
	Лицензионный договор
	Загрузить рукопись
	Историческая справка

	Поиск публикаций
	Поиск ссылок

	RSS
	Последний выпуск
	Текущие выпуски
	Архивные выпуски
	Что такое RSS

УМН:
Год:
Том:
Выпуск:
Страница:
	Найти

Персональный вход:
Логин:
Пароль:
	Запомнить пароль
	Войти
	Забыли пароль?
	Регистрация

УМН, 1997, том 52, выпуск 6(318), страницы 53–112 (Mi umn892)

Эта публикация цитируется в 369 научных статьях (всего в 370 статьях)

Квантовые вычисления: алгоритмы и исправление ошибок

А. Ю. Китаев

Институт теоретической физики им. Л. Д. Ландау РАН

DOI: https://doi.org/10.4213/rm892

Полный текст: PDF файл (749 kB)

Список литературы: PDF файл HTML файл

Англоязычная версия:
Russian Mathematical Surveys, 1997, 52:6, 1191–1249

Реферативные базы данных:

УДК: 519.712.3
MSC: 81P68, 68Q05, 94B60
Поступила в редакцию: 28.12.1996

Образец цитирования: А. Ю. Китаев, “Квантовые вычисления: алгоритмы и исправление ошибок”, УМН, 52:6(318) (1997), 53–112; Russian Math. Surveys, 52:6 (1997), 1191–1249

Цитирование в формате AMSBIB

\RBibitem{Kit97}

\by А.~Ю.~Китаев

\paper Квантовые вычисления: алгоритмы и~исправление ошибок

\jour УМН

\yr 1997

\vol 52

\issue 6(318)

\pages 53--112

\mathnet{http://mi.mathnet.ru/umn892}

\crossref{https://doi.org/10.4213/rm892}

\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1611329}

\zmath{https://zbmath.org/?q=an:0917.68063}

\adsnasa{http://adsabs.harvard.edu/cgi-bin/bib_query?1997RuMaS..52.1191K}

\transl

\jour Russian Math. Surveys

\yr 1997

\vol 52

\issue 6

\pages 1191--1249

\crossref{https://doi.org/10.1070/RM1997v052n06ABEH002155}

\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000074185000002}

\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-0040052002}

Образцы ссылок на эту страницу:

http://mi.mathnet.ru/umn892

https://doi.org/10.4213/rm892

http://mi.mathnet.ru/rus/umn/v52/i6/p53

ОТПРАВИТЬ:

Citing articles on Google Scholar: Russian citations, English citations
Related articles on Google Scholar: Russian articles, English articles

Эта публикация цитируется в следующих статьяx:

H.-J. Briegel, W. Dür, J. I. Cirac, P. Zoller, “Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication”, Phys Rev Letters, 81:26 (1998), 5932
Knill, E, “Power of one bit of quantum information”, Physical Review Letters, 81:25 (1998), 5672
Cory, DG, “Experimental quantum error correction”, Physical Review Letters, 81:10 (1998), 2152
Preskill, J, “Robust solutions to hard problems”, Nature, 391:6668 (1998), 631
John Preskill, “Battling Decoherence: The Fault-Tolerant Quantum Computer”, Phys Today, 52:6 (1999), 24
H. Chau, “Good quantum-convolutional error-correction codes and their decoding algorithm exist”, Phys Rev A, 60:3 (1999), 1966
Molotkov S.N., Nazin S.S., “Relativistic quantum coin tossing”, JETP Lett., 70:10 (1999), 702–708
Ogburn, RW, “Topological quantum computation”, Quantum Computing and Quantum Communications, 1509 (1999), 341
Molotkov S.N., Nazin S.S., “Measurement of the state of an individual spin using a “turnstile””, JETP Lett., 70:2 (1999), 147–153
Shor, PW, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer”, SIAM Review, 41:2 (1999), 303
Steane, AM, “Efficient fault-tolerant quantum computing”, Nature, 399:6732 (1999), 124
Lo, HK, “Unconditional security of quantum key distribution over arbitrarily long distances”, Science, 283:5410 (1999), 2050
H. F. Chau, “Quantum-classical complexity-security tradeoff in secure multiparty computations”, Phys Rev A, 61:3 (2000), 032308
Dorit Aharonov, “Quantum to classical phase transition in noisy quantum computers”, Phys Rev A, 62:6 (2000), 062311
Zhou Xinlan, Leung D.W., Chuang I.L., “Methodology for quantum logic gate construction”, Phys. Rev. A, 62:5 (2000), 052316, 12 pp.
Emanuel Knill, Raymond Laflamme, Lorenza Viola, “Theory of Quantum Error Correction for General Noise”, Phys Rev Letters, 84:11 (2000), 2525
S. Bandyopadhyay, “Self-assembled nanoelectronic quantum computer based on the Rashba effect in quantum dots”, Phys Rev B, 61:20 (2000), 13813
Barbara Terhal, David DiVincenzo, “Problem of equilibration and the computation of correlation functions on a quantum computer”, Phys Rev A, 61:2 (2000), 022301
Fedichkin, L, “Coherent charge qubits based on GaAs quantum dots with a built-in barrier”, Nanotechnology, 11:4 (2000), 387
Cory, DG, “NMR based quantum information processing: Achievements and prospects”, Fortschritte der Physik-Progress of Physics, 48:9–11 (2000), 875
DiVincenzo, DP, “Universal quantum computation with the exchange interaction”, Nature, 408:6810 (2000), 339
Boykin, PO, “A new universal and fault-tolerant quantum basis”, Information Processing Letters, 75:3 (2000), 101
Manin, YI, “Classical computing, quantum computing, and Shor's factoring algorithm”, Astérisque, 266, 2000, 375
Knill, E, “An algorithmic benchmark for quantum information processing”, Nature, 404:6776 (2000), 368
Briegel, HJ, “Quantum computing with neutral atoms”, Journal of Modern Optics, 47:2–3 (2000), 415
Mussinger, M, “Error avoiding quantum codes and dynamical stabilization of Grover's algorithm”, New Journal of Physics, 2 (2000), 191
Watrous J., “Succinct quantum proofs for properties of finite groups”, 41St Annual Symposium on Foundations of Computer Science, Proceedings, Annual IEEE Symposium on Foundations of Computer Science, 2000, 537–546
de Wolf R., “Characterization of non-deterministic quantum query and quantum communication complexity”, 15th Annual IEEE Conference on Computational Complexity, 2000, 271–278
Eghbalnia H., Assadi A., “Quantum neurocomputation”, Quantum Computing, Proceedings of the Society of Photo-Optical Instrumentation Engineers (SPIE), 4047, 2000, 12–18
Daniel A. Lidar, Dave Bacon, Julia Kempe, K. B. Whaley, “Decoherence-free subspaces for multiple-qubit errors. II. Universal, fault-tolerant quantum computation”, Phys Rev A, 63:2 (2001), 022307
J. Kempe, D. Bacon, D. A. Lidar, K. B. Whaley, “Theory of decoherence-free fault-tolerant universal quantum computation”, Phys Rev A, 63:4 (2001), 042307
Г. Л. Литвинов, В. П. Маслов, Г. Б. Шпиз, “Нецифровая реализация арифметики вещественных чисел средствами квантовых компьютерных сред”, Матем. заметки, 70:1 (2001), 59–67 ; G. L. Litvinov, V. P. Maslov, G. B. Shpiz, “Nondigital Implementation of the Arithmetic of Real Numbers”, Math. Notes, 70:1 (2001), 53–60
Freedman, MH, “Quantum computation and the localization of modular functors”, Foundations of Computational Mathematics, 1:2 (2001), 183
Freedman, MH, “Projective plane and planar quantum codes”, Foundations of Computational Mathematics, 1:3 (2001), 325
Kivelson, SA, “Electron fractionalization”, Synthetic Metals, 125:1 (2001), 99
Molotkov, SN, “Relativistic quantum protocols: Bit commitment and coin tossing”, Journal of Experimental and Theoretical Physics, 93:4 (2001), 876
Alber, G, “From the foundations of quantum theory to quantum technology - An introduction”, Quantum Information, 173 (2001), 1
Bandyopadhyay, S, “A nanospintronic universal quantum gate”, Physica E-Low-Dimensional Systems & Nanostructures, 11:2–3 (2001), 126
Roychowdhury, VP, “Quantum formulas: A lower bound and simulation”, SIAM Journal on Computing, 31:2 (2001), 460
Gershenfeld, N, “A quantum conversation”, Science, 293:5537 (2001), 2035
Knill, E, “Quantum computing and quadratically signed weight enumerators”, Information Processing Letters, 79:4 (2001), 173
Nebe, G, “The invariants of the Clifford groups”, Designs Codes and Cryptography, 24:1 (2001), 99
Molotkov, SN, “Quantum bit commitment in a channel with noise”, JETP Letters, 73:2 (2001), 107
Knill, E, “A scheme for efficient quantum computation with linear optics”, Nature, 409:6816 (2001), 46
Knill E., Laflamme R., Milburn G.J., “Efficient linear optics quantum computation”, Experimental Implementation of Quantum Computation, 2001, 214–219
Aram W. Harrow, Benjamin Recht, Isaac L. Chuang, “Efficient discrete approximations of quantum gates”, J Math Phys (N Y ), 43:9 (2002), 4445
Eric Dennis, Alexei Kitaev, Andrew Landahl, John Preskill, “Topological quantum memory”, J Math Phys (N Y ), 43:9 (2002), 4452
S. D. Barrett, C. H. W. Barnes, “Double-occupation errors induced by orbital dephasing in exchange-interaction quantum gates”, Phys Rev B, 66:12 (2002), 125318
Maxim Raginsky, “Strictly contractive quantum channels and physically realizable quantum computers”, Phys Rev A, 65:3 (2002), 032306
Hans Aschauer, Hans J. Briegel, “Security proof of quantum cryptography based entirely on entanglement purification”, Phys Rev A, 66:3 (2002), 032302
A. Galindo, M. A. Martín-Delgado, “Information and computation: Classical and quantum aspects”, Rev Mod Phys, 74:2 (2002), 347–423
Giorgadze, G, “Monodromy approach to quantum computing”, International Journal of Modern Physics B, 16:30 (2002), 4593
Ambainis, A, “Two-way finite automata with quantum and classical states”, Theoretical Computer Science, 287:1 (2002), 299
Freedman, MH, “The two-eigenvalue problem and density of Jones representation of braid groups”, Communications in Mathematical Physics, 228:1 (2002), 177
Freedman, MH, “Simulation of topological field theories by quantum computers”, Communications in Mathematical Physics, 227:3 (2002), 587
Freedman, MH, “A modular functor which is universal for quantum computation”, Communications in Mathematical Physics, 227:3 (2002), 605
Bravyi, SB, “Fermionic quantum computation”, Annals of Physics, 298:1 (2002), 210
Nishimura, H, “Computational complexity of uniform quantum circuit families and quantum Turing machines”, Theoretical Computer Science, 276:1–2 (2002), 147
Poulin, D, “Classicality of quantum information processing”, Physical Review A, 65:4 (2002), 042319
Raginsky, M, “Almost any quantum spin system with short-range interactions can support toric codes”, Physics Letters A, 294:3–4 (2002), 153
Sazonova Z.S., Singh R., “Detection and correction of errors with quantum tomography”, ICONO 2001: Quantum and Atomic Optics, High-Precision Measurements in Optics, and Optical Information Processing, Transmission, and Storage, Proceedings of the Society of Photo-Optical Instrumentation Engineers (SPIE), 4750, 2002, 47–53
Maxim Raginsky, “Radon–Nikodym derivatives of quantum operations”, J Math Phys (N Y ), 44:11 (2003), 5003
Evan M. Fortunato, Lorenza Viola, Marco A. Pravia, Emanuel Knill, Raymond Laflamme, Timothy F. Havel, David G. Cory, “Exploring noiseless subsystems via nuclear magnetic resonance”, Phys Rev A, 67:6 (2003), 062303
Stephen S. Bullock, “Arbitrary two-qubit computation in 23 elementary gates”, Phys Rev A, 68:1 (2003), 012318
W. Dür, H.-J. Briegel, “Entanglement Purification for Quantum Computation”, Phys Rev Letters, 90:6 (2003), 067901
Jun Zhang, Jiri Vala, Shankar Sastry, K. Birgitta Whaley, “Geometric theory of nonlocal two-qubit operations”, Phys Rev A, 67:4 (2003), 042313
Andreas Klappenecker, “Engineering functional quantum algorithms”, Phys Rev A, 67:1 (2003), 010302
Wojciech Hubert Zurek, “Decoherence, einselection, and the quantum origins of the classical”, Rev Mod Phys, 75:3 (2003), 715
Blais, A, “Algorithms and architectures for superconducting quantum computers”, Annales de Physique, 28:5 (2003), 1
Aaronson, S, “Algorithms for Boolean function query properties”, SIAM Journal on Computing, 32:5 (2003), 1140
Hallgren, S, “The hidden subgroup problem and quantum computation using group representations”, SIAM Journal on Computing, 32:4 (2003), 916
Freedman, MH, “A magnetic model with a possible Chern-Simons phase”, Communications in Mathematical Physics, 234:1 (2003), 129
Shi, YY, “Both Toffoli and Controlled-NOT need little help to do universal quantum computing”, Quantum Inf. Comput., 3:1 (2003), 84
Fortnow, L, “One complexity theorist's view of quantum computing”, Theoretical Computer Science, 292:3 (2003), 597
Kitaev, AY, “Fault-tolerant quantum computation by anyons”, Annals of Physics, 303:1 (2003), 2
Freedman, MH, “Topological quantum computation”, Bulletin of the American Mathematical Society, 40:1 (2003), 31
Lidar D.A., Wu L.A., “Quantum computers and decoherence: Exorcising the demon from the machine”, Noise and Information in Nanoelectronics, Sensors and Standards, Proceedings of the Society of Photo-Optical Instrumentation Engineers (SPIE), 5115, 2003, 256–270
van Dam W., Hallgren S., Ip L., “Quantum algorithms for some hidden shift problems”, Proceedings of the Fourteenth Annual Acm-SIAM Symposium on Discrete Algorithms, SIAM Proceedings Series, 2003, 489–498
ANDREAS KLAPPENECKER, MARTIN RÖTTELER, “QUANTUM SOFTWARE REUSABILITY”, Int. J. Found. Comput. Sci, 14:05 (2003), 777
HARUMICHI NISHIMURA, “QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES”, Int. J. Found. Comput. Sci, 14:05 (2003), 853
TOMOYUKI YAMAKAMI, “ANALYSIS OF QUANTUM FUNCTIONS”, Int. J. Found. Comput. Sci, 14:05 (2003), 815
Juha J. Vartiainen, Mikko Möttönen, Martti M. Salomaa, “Efficient Decomposition of Quantum Gates”, Phys Rev Letters, 92:17 (2004), 177902
Austin G. Fowler, Lloyd C. L. Hollenberg, “Scalability of Shor's algorithm with a limited set of rotation gates”, Phys Rev A, 70:3 (2004), 032329
М. Н. Вялый, “Приближенное вычисление весовой функции линейного двоичного кода”, Дискретн. анализ и исслед. опер., сер. 1, сер. 1, 11:4 (2004), 3–19
Fedorov, A, “Evaluation of Decoherence for Quantum Control and Computing”, Journal of Computational and Theoretical Nanoscience, 1:2 (2004), 132
Ohno, T, “Phase structure of the random-plaquette Z(2) gauge model: accuracy threshold for a toric quantum memory”, Nuclear Physics B, 697:3 (2004), 462
Razborov, AA, “An upper bound on the threshold quantum decoherence rate”, Quantum Inf. Comput., 4:3 (2004), 222
Fedichkin, L, “Additivity of decoherence measures for multiqubit quantum systems”, Physics Letters A, 328:2–3 (2004), 87
Ettinger, M, “The quantum query complexity of the hidden subgroup problem is polynomial”, Information Processing Letters, 91:1 (2004), 43
Nishimura, H, “Polynomial time quantum computation with advice”, Information Processing Letters, 90:4 (2004), 195
Marriott C., Watrous J., “Quantum Arthur-Merlin games”, Annual IEEE Conference on Computational Complexity, 2004, 275–285
Boykin P.O., Mor T., Roychowdhury V.P., Vatan F., “Fault tolerant computation on ensemble quantum computers”, 2004 International Conference on Dependable Systems and Networks, Proceedings, 2004, 157–166
Batty M., Braunstein S.L., Duncan A.J., Rees S., “Quantum algorithms in group theory”, Computational and Experimental Group Theory, Contemporary Mathematics Series, 349, 2004, 1–62
Caterina E. Mora, Hans J. Briegel, “Algorithmic Complexity and Entanglement of Quantum States”, Phys Rev Letters, 95:20 (2005), 200503
Viacheslav P. Belavkin, Giacomo Mauro D'Ariano, Maxim Raginsky, “Operational distance and fidelity for quantum channels”, J Math Phys (N Y ), 46:6 (2005), 062106
Scott Aaronson, “Quantum computing, postselection, and probabilistic polynomial-time”, Proceedings Mathematical Physical and Engineering Sciences, 461:2063 (2005), 3473
E. Knill, “Quantum computing with realistically noisy devices”, Appl Opt, 434:7029 (2005), 39
Harumichi Nishimura, “Quantum Computation with Supplementary Information”, ipsjdc, 1 (2005), 407
L. M. K. Vandersypen, “NMR techniques for quantum control and computation”, Rev Mod Phys, 76:4 (2005), 1037
C. Negrevergne, R. Somma, G. Ortiz, E. Knill, R. Laflamme, “Liquid-state NMR simulations of quantum many-body problems”, Phys Rev A, 71:3 (2005), 032344
Scott Aaronson, “Quantum computing and hidden variables”, Phys Rev A, 71:3 (2005), 032325
Nemoto, K, “Universal quantum computation on the power of quantum non-demolition measurements”, Physics Letters A, 344:2–4 (2005), 104
Marriott, C, “Quantum Arthur-Merlin games”, Computational Complexity, 14:2 (2005), 122
Kribs, DW, “A quantum computing primer for operator theorists”, Linear Algebra and Its Applications, 400 (2005), 147
Watrous, J, “Notes on super-operator norms induced by schatten norms”, Quantum Inf. Comput., 5:1 (2005), 58
Bordewich, M, “Approximate counting and quantum computation”, Combinatorics Probability & Computing, 14:5–6 (2005), 737
Fowler A.G., Devitt S.J., Hollenberg L.C.L., “Constructing Steane code fault-tolerant gates”, Micro- and Nanotechnology: Materials, Processes, Packaging, and Systems II, Proceedings of the Society of Photo-Optical Instrumentation Engineers (SPIE), 5650, 2005, 557–568
Rosgen B., Watrous J., “On the hardness of distinguishing mixed-state quantum computations”, Twentieth Annual IEEE Conference on Computational Complexity, 2005, 344–354
Devitt S.J., Fowler A.G., Hollenberg L.C.L., “Investigating the practical implementation of Shor's algorithm”, Micro- and Nanotechnology: Materials, Processes, Packaging, and Systems II, Proceedings of the Society of Photo-Optical Instrumentation Engineers (SPIE), 5650, 2005, 483–494
Zhengfeng Ji, Yuan Feng, Runyao Duan, Mingsheng Ying, “Identification and Distance Measures of Measurement Apparatus”, Phys Rev Letters, 96:20 (2006), 200401
H. Bombin, M. A. Martin-Delgado, “Topological quantum error correction with optimal encoding rate”, Phys Rev A, 73:6 (2006), 062303
Sergey Bravyi, “Universal quantum computation with the $\nu=5/2$ fractional quantum Hall state”, Phys Rev A, 73:4 (2006), 042313
Dorit Aharonov, Alexei Kitaev, John Preskill, “Fault-Tolerant Quantum Computation with Long-Range Correlated Noise”, Phys Rev Letters, 96:5 (2006), 050504
Dave Bacon, “Operator quantum error-correcting subsystems for self-correcting quantum memories”, Phys Rev A, 73:1 (2006), 012340
Martin Rötteler, “Quantum algorithms: A survey of some recent results”, Informatik Forschung und Entwicklung, 21:1-2 (2006), 3
Andreas Klappenecker, Martin Rötteler, “Effiziente Quantenalgorithmen (Efficient Quantum Algorithms)”, itit, 48:6 (2006), 344
Wim van Dam, Sean Hallgren, Lawrence Ip, “Quantum Algorithms for Some Hidden Shift Problems”, SIAM J Comput, 36:3 (2006), 763
Subhash Kak, “Information Complexity of Quantum Gates”, Int J Theor Phys, 45:5 (2006), 963
Ketkar, A, “Nonbinary stabilizer codes over finite fields”, IEEE Transactions on Information Theory, 52:11 (2006), 4892
Mora, CE, “Algorithmic complexity of quantum states”, International Journal of Quantum Information, 4:4 (2006), 715
Reichardt, BW, “Fault-tolerance threshold for a distance-three quantum code”, Automata, Languages and Programming, Pt 1, 4051 (2006), 50
Aliferis, P, “Quantum accuracy threshold for concatenated distance-3 codes”, Quantum Inf. Comput., 6:2 (2006), 97
Nielsen, MA, “A geometric approach to quantum circuit lower bounds”, Quantum Inf. Comput., 6:3 (2006), 213
Dawson, CM, “The Solovay-Kitaev algorithm”, Quantum Inf. Comput., 6:1 (2006), 81
Reichardt B.W., “Postselection threshold against biased noise”, 47th Annual IEEE Symposium on Foundations of Computer Science, 2006, 420–428
Gruska J., “Universal sets of quantum information processing primitives and their optimal use”, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, 4123, 2006, 425–451
Belonenko M.B., Levin K.A., “Low temperature solitonic mechanism coherent state transfer in Tanamoto quantum computer model”, Photon Echo and Coherent Spectroscopy 2005, Proceedings of the Society of Photo-Optical Instrumentation Engineers (SPIE), 6181, 2006
Wim van Dam, G. Mauro D'Ariano, Artur Ekert, Chiara Macchiavello, Michele Mosca, “Optimal Quantum Circuits for General Phase Estimation”, Phys Rev Letters, 98:9 (2007), 090501
Wim van Dam, Frederic Magniez, Michele Mosca, Miklos Santha, “Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates”, SIAM J Comput, 37:2 (2007), 611
Wim van Dam, G Mauro D'Ariano, Artur Ekert, Chiara Macchiavello, Michele Mosca, “Optimal phase estimation in quantum networks”, J Phys A Math Theor, 40:28 (2007), 7971
Ognyan Oreshkov, “Continuous quantum error correction for non-Markovian decoherence”, Phys Rev A, 76:2 (2007), 022318
Simone Montangero, Tommaso Calarco, Rosario Fazio, “Robust Optimal Quantum Gates for Josephson Charge Qubits”, Phys Rev Letters, 99:17 (2007), 170501
Ben W. Reichardt, “Error-Detection-Based Quantum Fault-Tolerance Threshold”, Algorithmica, 2007
David P. DiVincenzo, Panos Aliferis, “Effective Fault-Tolerant Quantum Computation with Slow Measurements”, Phys Rev Letters, 98:2 (2007), 020501
Li, R, “High-fidelity single-qubit gates using non-adiabatic rapid passage”, Quantum Inf. Comput., 7:7 (2007), 594
Silva, M, “A direct approach to fault-tolerance in measurement-based quantum computation via teleportation”, New Journal of Physics, 9 (2007), 192
Ardonne, E, “Wavefunctions for topological quantum registers”, Annals of Physics, 322:1 (2007), 201
Aliferis, P, “Fault-tolerant quantum computation for local leakage faults”, Quantum Inf. Comput., 7:1-2 (2007), 139
Emerson, J, “Symmetrized characterization of noisy quantum processes”, Science, 317:5846 (2007), 1893
Childs A.M., Schulman L.J., Vazirani U.V., “Quantum algorithms for hidden nonlinear structures”, 48th Annual IEEE Symposium on Foundations of Computer Science, Proceedings, 2007, 395–404
Kempe J., “Approaches to quantum error correction”, Quantum Decoherence: Poincare Seminar 2005, Progress in Mathematical Physics, 48, 2007, 85–123
Gilbert G., Hamrick M., Weinstein Ya.S., “Faulty quantum computation can result in reliable classical outputs - art. no. 657304”, Quantum Information and Computation V, Proceedings of the Society of Photo-Optical Instrumentation Engineers (SPIE), 6573, 2007, 57304–57304
Gerald Gilbert, Michael Hamrick, Yaakov S. Weinstein, “End-to-end fault tolerance”, Quantum Inf Process, 2008
G. Giorgadze, “Analytic methods in quantum computing”, Journal of Mathematical Sciences (New York), 2008
A. Shabani, “Correlated errors can lead to better performance of quantum codes”, Phys Rev A, 77:2 (2008), 022323
Martin Rötteler, Thomas Beth, “Representation-theoretical properties of the approximate quantum Fourier transform”, Appl Algebra Engrg Comm Comput, 19:3 (2008), 177
Ognyan Oreshkov, “Robustness of operator quantum error correction with respect to initialization errors”, Phys Rev A, 77:3 (2008), 032333
Dorit Aharonov, Michael Ben-Or, “Fault-Tolerant Quantum Computation with Constant Error Rate”, SIAM J Comput, 38:4 (2008), 1207
Ognyan Oreshkov, Daniel A. Lidar, Todd A. Brun, “Operator quantum error correction for continuous dynamics”, Phys Rev A, 78:2 (2008), 022333
Dennis Kretschmann, David W. Kribs, Robert W. Spekkens, “Complementarity of private and correctable subsystems in quantum cryptography and error correction”, Phys Rev A, 78:3 (2008), 032330
Gao Yu-Mei, Zhang Xin-Ding, Hu Lian, “Geometric phase and topology quantum gates using parallel transportation”, Int. J. Geom. Methods Mod. Phys., 5:5 (2008), 789–798
Shor, PW, “Estimating Jones polynomials is a complete problem for one clean qubit”, Quantum Inf. Comput., 8:8-9 (2008), 681
Watrous, J, “Distinguishing quantum operations having few Kraus operators”, Quantum Inf. Comput., 8:8-9 (2008), 819
Emerson, J, “Symmetrization methods for characterization and benchmarking of quantum processes”, Canadian Journal of Physics, 86:4 (2008), 557
Aliferis, P, “Accuracy threshold for postselected quantum computation”, Quantum Inf. Comput., 8:3-4 (2008), 181
Wocjan, P, “The Jones polynomial: Quantum algorithms and applications in quantum complexity theory”, Quantum Inf. Comput., 8:1-2 (2008), 147
Krovi H., Roetteler M., “An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups”, Mathematical Methods in Computer Science - Essays in Memory of Thomas Beth, Lecture Notes in Computer Science, 5393, 2008, 70–88
Kempe J., Regev O., Unger F., de Wolf R., “Upper bounds on the noise threshold for fault-tolerant quantum computing”, Automata, Languages and Programming, Lecture Notes in Computer Science, 5125, 2008, 845–856
Matthias Christandl, Renato Renner, “Postselection Technique for Quantum Channels with Applications to Quantum Cryptography”, Phys Rev Letters, 102:2 (2009), 020504
Kaveh Khodjasteh, Lorenza Viola, “Dynamically Error-Corrected Gates for Universal Quantum Computation”, Phys Rev Letters, 102:8 (2009), 080501
Hui Khoon Ng, John Preskill, “Fault-tolerant quantum computation versus Gaussian noise”, Phys Rev A, 79:3 (2009), 032318
Bryan Eastin, Emanuel Knill, “Restrictions on Transversal Encoded Quantum Gate Sets”, Phys Rev Letters, 102:11 (2009), 110502
Anthony Laing, Terry Rudolph, Jeremy L. O'Brien, “Experimental Quantum Process Discrimination”, Phys Rev Letters, 102:16 (2009), 160502
John Watrous, “Zero-Knowledge against Quantum Attacks”, SIAM J Comput, 39:1 (2009), 25
P. Oscar Boykin, Tal Mor, Vwani Roychowdhury, Farrokh Vatan, “Algorithms on ensemble quantum computers”, Nat Comput, 2009
Marco Piani, John Watrous, “All Entangled States are Useful for Channel Discrimination”, Phys Rev Letters, 102:25 (2009), 250501
Hiroshi Imai, Masahito Hayashi, “Fourier analytic approach to phase estimation in quantum systems”, New J Phys, 11:4 (2009), 043034
M. B. Hastings, “Quantum Adiabatic Computation with a Constant Gap Is Not Useful in One Dimension”, Phys Rev Letters, 103:5 (2009), 050502
J K Pachos, W Wieczorek, C Schmid, N Kiesel, R Pohlner, H Weinfurter, “Revealing anyonic features in a toric code quantum simulation”, New J Phys, 11:8 (2009), 083010
Ognyan Oreshkov, Todd A. Brun, Daniel A. Lidar, “Scheme for fault-tolerant holonomic computation on stabilizer codes”, Phys Rev A, 80:2 (2009), 022325
Kaveh Khodjasteh, Lorenza Viola, “Dynamical quantum error correction of unitary operations with bounded controls”, Phys Rev A, 80:3 (2009), 032314
Runyao Duan, Yuan Feng, Mingsheng Ying, “Perfect Distinguishability of Quantum Operations”, Phys Rev Letters, 103:21 (2009), 210501
Fedichkin L., Privman V., “Quantitative treatment of decoherence”, Electron Spin Resonance and Related Phenomena in Low-Dimensional Structures, Topics in Applied Physics, 115, 2009, 141–167
Ying, MS, “An Algebra of Quantum Processes”, Acm Transactions on Computational Logic, 10:3 (2009), 19
Li R., Hoover M., Gaitan F., “High fidelity universal set of quantum gates using non-adiabatic rapid passage”, Quantum Inf. Comput., 9:3-4 (2009), 290–316
Nishimura, H, “An application of quantum finite automata to interactive proof systems”, Journal of Computer and System Sciences, 75:4 (2009), 255
Johnston N., Kribs D.W., Paulsen V.I., “Computing stabilized norms for quantum operations via the theory of completely bounded maps”, Quantum Inf. Comput., 9:1–2 (2009), 16
Aggarwal V., Calderbank R., Gilbert G., Weinstein Ya.S., “Engineering Fault Tolerance for Realistic Quantum Systems via the Full Error Dynamics of Quantum Codes”, IEEE International Symposium on Information Theory, 2009, 958–962
Roetteler M., “Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm”, Mathematical Foundations of Computer Science 2009, Lecture Notes in Computer Science, 5734, 2009, 663–674
Gilbert G., Weinstein Ya.S., “A Universal Operator Theoretic Framework for Quantum Fault Tolerance”, Quantum Communication, Measurement and Computing (Qcmc), AIP Conference Proceedings, 1110, 2009, 83–86
Gilbert G., Weinstein Y.S., Aggarwal V., Calderbank A.R., “Practical Quantum Fault Tolerance”, Quantum Information and Computation VII, Proceedings of SPIE, 7342, eds. Donkor E., Pirich A., Brandt H., SPIE-Int Soc Optical Engineering, 2009, 734202
Ben-Aroya A., Ta-Shma A., “On the complexity of approximating the diamond norm”, Quantum Inf. Comput., 10:1-2 (2010), 77–86
M B Plenio, S Virmani, “Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers”, New J Phys, 12:3 (2010), 033012
S. Devitt, “Scalable quantum information processing and the optical topological quantum computer”, Opt Spectrosc, 108:2 (2010), 267
Andrew M. Childs, “Quantum algorithms for algebraic problems”, Rev Mod Phys, 82:1 (2010), 1
Cédric Bény, Ognyan Oreshkov, “General Conditions for Approximate Quantum Error Correction and Near-Optimal Recovery Channels”, Phys Rev Letters, 104:12 (2010), 120501
Aram W. Harrow, Debbie W. Leung, John Watrous, “Adaptive versus nonadaptive strategies for quantum channel discrimination”, Phys Rev A, 81:3 (2010), 032339
Caterina E. Mora, Marco Piani, Akimasa Miyake, Maarten Van den Nest, Wolfgang Dür, Hans J. Briegel, “Universal resources for approximate and stochastic measurement-based quantum computation”, Phys Rev A, 81:4 (2010), 042315
Keisuke Fujii, Katsuji Yamamoto, “Cluster-based architecture for fault-tolerant quantum computation”, Phys Rev A, 81:4 (2010), 042324
Beni Yoshida, Isaac L. Chuang, “Framework for classifying logical operators in stabilizer codes”, Phys Rev A, 81:5 (2010), 052302
Tobias Moroder, Otfried Gühne, Normand Beaudry, Marco Piani, Norbert Lütkenhaus, “Entanglement verification with realistic measurement devices via squashing operations”, Phys Rev A, 81:5 (2010), 052342
Vaneet Aggarwal, A. Robert Calderbank, Gerald Gilbert, Yaakov S. Weinstein, “Volume thresholds for quantum fault tolerance”, Quantum Inf Process, 2010
Alex Monras, Fabrizio Illuminati, “Information geometry of Gaussian channels”, Phys Rev A, 81:6 (2010), 062326
Joseph Geraci, Daniel A Lidar, “Classical Ising model test for quantum circuits”, New J Phys, 12:7 (2010), 075026
William Matthews, Marco Piani, John Watrous, “Entanglement in channel discrimination with restricted measurements”, Phys Rev A, 82:3 (2010), 032302
Jon Tyson, “Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on maximum overlap using directional iterates”, J Math Phys (N Y ), 51:9 (2010), 092204
Anindita Banerjee, Anirban Pathak, “Optically implementable designs of reversible sequential devices”, Indian J Phys, 84:8 (2010), 1063
Soraya Taghavi, Todd Brun, Daniel Lidar, “Optimized entanglement-assisted quantum error correction”, Phys Rev A, 82:4 (2010), 042321
Keisuke Fujii, Yuuki Tokunaga, “Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates”, Phys Rev Letters, 105:25 (2010), 250503
Keisuke Fujii, Katsuji Yamamoto, “Topological one-way quantum computation on verified logical cluster states”, Phys Rev A, 82:6 (2010), 060301
Li R., Gaitan F., “High-Fidelity Universal Quantum Gates Through Group-Symmetrized Rapid Passage”, Quantum Information & Computation, 10:11–12 (2010), 936–946
Jacak J., Jozwiak I., Jacak L., “Composite Fermions in Braid Group Terms”, Open Systems & Information Dynamics, 17:1 (2010), 53–71
Devitt S.J., Fowler A.G., Tilma T., Munro W.J., Nemoto K., “Classical Processing Requirements for a Topological Quantum Computing System”, International Journal of Quantum Information, 8:1–2 (2010), 121–147
Kempe J., Regev O., Unger F., de Wolf R., “Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing”, Quantum Information & Computation, 10:5–6 (2010), 361–376
Li R., Gaitan F., “High-fidelity universal quantum gates through quantum interference”, Quantum Information and Computation VIII, Proceedings of SPIE-the International Society for Optical Engineering, 7702, 2010
Broadbent A., Fitzsimons J., Kashefi E., “Measurement-Based and Universal Blind Quantum Computation”, Formal Methods for Quantitative Aspects of Programming Languages, Lecture Notes in Computer Science, 6154, 2010, 43–86
Gaitan F., Li R., “Quantum Error Correction and Fault-Tolerant Quantum Computing”, Decoherence Suppression in Quantum Systems 2008, Kinki University Series on Quantum Computing, 3, 2010, 53–124
Roetteler M., “Quantum algorithms for highly non-linear Boolean functions”, Proceedings of the Twenty-First Annual Acm-SIAM Symposium on Discrete Algorithms, Proceedings in Applied Mathematics, 135, 2010, 448–457
Van Meter R., Ladd T.D., Fowler A.G., Yamamoto Y., “Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics”, International Journal of Quantum Information, 8:1–2 (2010), 295–323
Carlos Pérez-Delgado, Pieter Kok, “Quantum computers: Definition and implementations”, Phys. Rev. A, 83:1 (2011)
Saleh Rahimi-Keshari, Artur Scherer, Ady Mann, A T Rezakhani, A I Lvovsky, Barry C Sanders, “Quantum process tomography with coherent states”, New J. Phys, 13:1 (2011), 013006
Alexandre M. Souza, Jingfu Zhang, Colm A. Ryan, Raymond Laflamme, “Experimental magic state distillation for fault-tolerant quantum computing”, Nat Comms, 2 (2011), 169
K. Temme, T. J. Osborne, K. G. Vollbrecht, D. Poulin, F. Verstraete, “Quantum Metropolis sampling”, Nature, 471:7336 (2011), 87
N. Ratanje, S. Virmani, “Generalized state spaces and nonlocality in fault-tolerant quantum-computing schemes”, Phys. Rev. A, 83:3 (2011)
Amrit De, Alex Lang, Dong Zhou, Robert Joynt, “Suppression of decoherence and disentanglement by the exchange interaction”, Phys. Rev. A, 83:4 (2011)
James Whitfield, Jacob Biamonte, Alan Aspuru-Guzik, “Simulation of electronic structure Hamiltonians using quantum computers”, Mol. Phys, 109:5 (2011), 735
Hui Ng, Daniel Lidar, John Preskill, “Combining dynamical decoupling with fault-tolerant quantum computation”, Phys. Rev. A, 84:1 (2011)
Ran Li, Frank Gaitan, “Robust high-fidelity universal set of quantum gates through non-adiabatic rapid passage”, Journal of Modern Optics, 2011, 1
Haitan Xu, J. Taylor, “Unified approach to topological quantum computation with anyons: From qubit encoding to Toffoli gate”, Phys. Rev. A, 84:1 (2011)
Hong Liu, Wei-sheng Wang, “Controlled teleportation of an unknown 3D two-particle state via 3D partially entangled states”, Optoelectron. Lett, 7:4 (2011), 304
Mario Berta, Matthias Christandl, Renato Renner, “The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory”, Commun. Math. Phys, 2011
Marco Lanzagorta, Jeffrey Uhlmann, “Error scaling in fault tolerant quantum computation”, Applied Mathematics and Computation, 2011
Beni Yoshida, “Feasibility of self-correcting quantum memory and thermal stability of topological order”, Annals of Physics, 2011
Beni Yoshida, “Classification of quantum phases and topology of logical operators in an exactly solved model of quantum codes”, Annals of Physics, 326:1 (2011), 15
Simon J Devitt, Ashley M Stephens, William J Munro, Kae Nemoto, “Integration of highly probabilistic sources into optical quantum architectures: perpetual quantum computation”, New J. Phys, 13:9 (2011), 095001
Jingfu Zhang, Dorian Gangloff, Osama Moussa, Raymond Laflamme, “Experimental quantum error correction with high fidelity”, Phys. Rev. A, 84:3 (2011)
Roee Ozeri, “The trapped-ion qubit tool box”, Contemporary Physics, 52:6 (2011), 531
Samuel Ocko, Beni Yoshida, “Nonperturbative Gadget for Topological Quantum Codes”, Phys. Rev. Lett, 107:25 (2011)
Nathaniel Johnston, David W. Kribs, Vern I. Paulsen, Rajesh Pereira, “Minimal and maximal operator spaces and operator systems in entanglement theory”, Journal of Functional Analysis, 260:8 (2011), 2407
Steffen M., DiVincenzo D.P., Chow J.M., Theis T.N., Ketchen M.B., “Quantum computing: An IBM perspective”, Ibm Journal of Research and Development, 55:5 (2011), 13
Berta M., Christandl M., Renner R., “A Conceptually Simple Proof of the Quantum Reverse Shannon Theorem”, Theory of Quantum Computation, Communication, and Cryptography, Lecture Notes in Computer Science, 6519, 2011, 131–140
Fowler A.G., “Constructing Arbitrary Steane Code Single Logical Qubit Fault-Tolerant Gates”, Quantum Information & Computation, 11:9–10 (2011), 867–873
Magesan E., “Depolarizing Behavior of Quantum Channels in Higher Dimensions”, Quantum Information & Computation, 11:5–6 (2011), 466–484
Glutsyuk A., “Instability of nondiscrete free subgroups in lie groups”, Transform Groups, 16:2 (2011), 413–479
Childs A.M., Leung D., Mancinska L., Ozols M., “Characterization of Universal Two-Qubit Hamiltonians”, Quantum Information & Computation, 11:1–2 (2011), 19–39
GREGORY KARAGIORGOS, DIMITRIOS POULAKIS, “EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS”, Discrete Math. Algorithm. Appl, 03:04 (2011), 537
Jacak J., Jozwiak I., Jacak L., Wieczorek K., “Cyclotron Braid Group Approach to Laughlin Correlations”, Adv. Theor. Math. Phys., 15:2 (2011), 449–469
Xing-Can Yao, Tian-Xiong Wang, Hao-Ze Chen, Wei-Bo Gao, Austin G. Fowler, Robert Raussendorf, Zeng-Bing Chen, Nai-Le Liu, Chao-Yang Lu, You-Jin Deng, Yu-Ao Chen, Jian-Wei Pan, “Experimental demonstration of topological error correction”, Nature, 482:7386 (2012), 489
M. A. Martin-Delgado, “On Quantum Effects in a Theory of Biological Evolution”, Sci. Rep, 2 (2012)
Ashok Ajoy, Rama Koteswara Rao, Anil Kumar, Pranaw Rungta, “Algorithmic approach to simulate Hamiltonian dynamics and an NMR simulation of quantum state transfer”, Phys. Rev. A, 85:3 (2012)
Gus Gutoski, “On a measure of distance for quantum strategies”, J. Math. Phys, 53:3 (2012), 032202
O Viyuela, A Rivas, M A Martin-Delgado, “Generalized toric codes coupled to thermal baths”, New J. Phys, 14:3 (2012), 033044
Berry D.W., Childs A.M., “Black-Box Hamiltonian Simulation and Unitary Implementation”, Quantum Information & Computation, 12:1–2 (2012), 29–62
Juba B., “On Learning Finite-State Quantum Sources”, Quantum Information & Computation, 12:1–2 (2012), 105–118
Lu Ch., Chen J., Duan R., “Some Bounds on the Minimum Number of Queries Required for Quantum Channel Perfect Discrimination”, Quantum Information & Computation, 12:1–2 (2012), 138–148
Jingfu Zhang, Markus Grassl, Bei Zeng, Raymond Laflamme, “Experimental implementation of a codeword-stabilized quantum code”, Phys. Rev. A, 85:6 (2012)
B Douçot, L B Ioffe, “Physical implementation of protected qubits”, Rep. Prog. Phys, 75:7 (2012), 072001
Tomoyuki Morimae, Keisuke Fujii, “Not all physical errors can be linear CPTP maps in a correlation space”, Sci. Rep, 2 (2012)
Easwar Magesan, Jay Gambetta, B. Johnson, Colm Ryan, Jerry Chow, Seth Merkel, Marcus da Silva, George Keefe, Mary Rothwell, Thomas Ohki, Mark Ketchen, M. Steffen, “Efficient Measurement of Quantum Gate Error by Interleaved Randomized Benchmarking”, Phys. Rev. Lett, 109:8 (2012)
Austin Fowler, Matteo Mariantoni, John Martinis, Andrew Cleland, “Surface codes: Towards practical large-scale quantum computation”, Phys. Rev. A, 86:3 (2012)
Alex Bocharov, Krysta Svore, “Resource-Optimal Single-Qubit Quantum Circuits”, Phys. Rev. Lett, 109:19 (2012)
Markus Johansson, Erik Sjöqvist, L. Andersson, Marie Ericsson, Björn Hessmo, Kuldip Singh, D. Tong, “Robustness of nonadiabatic holonomic gates”, Phys. Rev. A, 86:6 (2012)
Berta M., Christandl M., Brandao Fernando G. S. L., Wehner S., “Entanglement Cost of Quantum Channels”, 2012 IEEE International Symposium on Information Theory Proceedings (ISIT), IEEE International Symposium on Information Theory, IEEE, 2012, 900–904
Mueller M., Diehl S., Pupillo G., Zoller P., “Engineered Open Systems and Quantum Simulations with Atoms and Ions”, Advances in Atomic, Molecular, and Optical Physics, Vol 61, Adv. Atom. Mol. Opt. Phys., 61, eds. Arimondo E., Berman P., Lin C., Elsevier Academic Press Inc, 2012, 1–80
Mosca M., “Quantum Computing, Cryptography and Compilers”, 2012 42nd IEEE International Symposium on Multiple-Valued Logic (Ismvl), International Symposium on Multiple-Valued Logic, IEEE, 2012, 154–156
Feng Yu., Duan R., Ying M., “Bisimulation for Quantum Processes”, ACM Trans. Program. Lang. Syst., 34:4 (2012), 17
Paetznick A., Reichardt B.W., “Fault-Tolerant Ancilla Preparation and Noise Threshold Lower Boudds for the 23-Qubit Golay Code”, Quantum Inform. Comput., 12:11-12 (2012), 1034–1080
Easwar Magesan, Daniel Puzzuoli, Christopher E. Granade, David G. Cory, “Modeling quantum noise for efficient testing of fault-tolerant circuits”, Phys. Rev. A, 87:1 (2013)
R. Beals, S. Brierley, O. Gray, A. W. Harrow, S. Kutin, N. Linden, D. Shepherd, M. Stather, “Efficient distributed quantum computing”, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 469:2153 (2013), 20120686
A. Stern, N. H. Lindner, “Topological Quantum Computation–From Basic Concepts to First Experiments”, Science, 339:6124 (2013), 1179
J Åberg, S Hengl, R Renner, “Directed quantum communication”, New J. Phys, 15:3 (2013), 033025
M. L. Dalla Chiara, A. Ledda, G. Sergioli, R. Giuntini, “The Toffoli-Hadamard Gate System: an Algebraic Approach”, J Philos Logic, 2013
R Sweke, I Sinayskiy, F Petruccione, “Dissipative preparation of generalized Bell states”, J. Phys. B: At. Mol. Opt. Phys, 46:10 (2013), 104004
A.M.. Childs, Nathan Wiebe, “Product formulas for exponentials of commutators”, J. Math. Phys, 54:6 (2013), 062202
S.J. Devitt, W.J. Munro, Kae Nemoto, “Quantum error correction for beginners”, Rep. Prog. Phys, 76:7 (2013), 076001
H Bombin, R.W. Chhajlany, M Horodecki, M.A. Martin-Delgado, “Self-correcting quantum computers”, New J. Phys, 15:5 (2013), 055023
T.T.rung Pham, Rodney Van Meter, Clare Horsman, “Optimization of the Solovay-Kitaev algorithm”, Phys. Rev. A, 87:5 (2013)
Oleg Szehr, Frédéric Dupuis, Marco Tomamichel, Renato Renner, “Decoupling with unitary approximate two-designs”, New J. Phys, 15:5 (2013), 053022
M.P.. da Silva, Saikat Guha, Zachary Dutton, “Achieving minimum-error discrimination of an arbitrary set of laser-light pulses”, Phys. Rev. A, 87:5 (2013)
Ya.S.. Weinstein, “Quantum-error-correction implementation after multiple gates”, Phys. Rev. A, 88:1 (2013)
Gang-Qin Liu, H.C.hun Po, Jiangfeng Du, Ren-Bao Liu, Xin-Yu Pan, “Noise-resilient quantum evolution steered by dynamical decoupling”, Nat Comms, 4 (2013)
Andrej Mesaros, Y.B.aek Kim, Ying Ran, “Changing topology by topological defects in three-dimensional topologically ordered phases”, Phys. Rev. B, 88:3 (2013)
M.R.. Geller, Zhongyuan Zhou, “Efficient error models for fault-tolerant architectures and the Pauli twirling approximation”, Phys. Rev. A, 88:1 (2013)
Easwar Magesan, Paola Cappellaro, “Experimentally efficient methods for estimating the performance of quantum measurements”, Phys. Rev. A, 88:2 (2013)
A.G.. Fowler, “Coping with qubit leakage in topological codes”, Phys. Rev. A, 88:4 (2013)
Roberto Bondesan, Thomas Quella, “Topological and symmetry broken phases ofZNparafermions in one dimension”, J. Stat. Mech, 2013:10 (2013), P10024
Ya.S.. Weinstein, “Pseudorandom circuits from Clifford-plus-T gates”, Phys. Rev. A, 88:6 (2013)
Sergey Bravyi, Alexander Vargo, “Simulation of rare events in quantum error correction”, Phys. Rev. A, 88:6 (2013)
И. А. Русанова, Квантовая электроника, 43:7 (2013), 651–655 ; Quantum Electron., 43:7 (2013), 651–655
M. I. Dyakonov, “Revisiting the hopes for scalable quantum computation”, Письма в ЖЭТФ, 98:8 (2013), 573–577 ; JETP Letters, 98:8 (2013), 514–518
Berta M., Brandao Fernando G. S. L., Christandl M., Wehner S., “Entanglement Cost of Quantum Channels”, IEEE Trans. Inf. Theory, 59:10 (2013), 6779–6795
Preskill J., “Sufficient Condition on Noise Correlations for Scalable Quantum Computing”, Quantum Inform. Comput., 13:3-4 (2013), 181–194
Hansen J.P., “Quantum Codes From Toric Surfaces”, IEEE Trans. Inf. Theory, 59:2 (2013), 1188–1192
Amento B., Roetteler M., Steinwandt R., “Quantum Binary Field Inversion: Improved Circuit Depth via Choice of Basis Representation”, Quantum Inform. Comput., 13:1-2 (2013), 116–134
Tomas Jochym-O’Connor, Raymond Laflamme, “Using Concatenated Quantum Codes for Universal Fault-Tolerant Quantum Gates”, Phys. Rev. Lett, 112:1 (2014)
J.M.. RENES, “THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT”, Int. J. Quantum Inform, 2014, 1330002
Ya.S.. Weinstein, “Quantum error correction during 50 gates”, Phys. Rev. A, 89:2 (2014)
A. Jenčová, “Base norms and discrimination of generalized quantum channels”, J. Math. Phys, 55:2 (2014), 022201
A.M.. Stephens, “Fault-tolerant thresholds for quantum error correction with the surface code”, Phys. Rev. A, 89:2 (2014)
M.B.. Hastings, G.H.. Watson, R.G.. Melko, “Self-Correcting Quantum Memories Beyond the Percolation Threshold”, Phys. Rev. Lett, 112:7 (2014)
Chi-H.F.red Fung, H.F. Chau, “Disguising quantum channels by mixing and channel distance trade-off”, J. Phys. A: Math. Theor, 47:10 (2014), 105302
N.C.. Menicucci, “Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States”, Phys. Rev. Lett, 112:12 (2014)
M.L.UISA DALLA CHIARA, ROBERTO GIUNTINI, GIUSEPPE SERGIOLI, “Probability in quantum computation and quantum computational logics: a survey”, Math. Struct. Comp. Sci, 24:03 (2014)
B. A. Bell, D. A. Herrera-Martí, M. S. Tame, D. Markham, W. J. Wadsworth, “Experimental demonstration of a graph state quantum error-correction code”, Nat Comms, 5 (2014)
Yangjia Li, Mingsheng Ying, “Debugging quantum processes using monitoring measurements”, Phys. Rev. A, 89:4 (2014)
J. Prabhu Tej, A. R. Usha Devi, H. S. Karthik, A. K. Rajagopal, “Quantum which-way information and fringe visibility when the detector is entangled with an ancilla”, Phys. Rev. A, 89:6 (2014)
Yuchen Peng, Frank Gaitan, “Improving quantum gate performance through neighboring optimal control”, Phys. Rev. A, 90:2 (2014)
Stefanie Barz, Ivan Kassal, Martin Ringbauer, Ya.O.le Lipp, Borivoje Dakić, “A two-qubit photonic quantum processor and its application to solving systems of linear equations”, Sci. Rep, 4 (2014), 6115
O.C. O Dahlsten, Cosmo Lupo, Stefano Mancini, Alessio Serafini, “Entanglement typicality”, J. Phys. A: Math. Theor, 47:36 (2014), 363001
Guofu Xu, Guilu Long, “Protecting geometric gates by dynamical decoupling”, Phys. Rev. A, 90:2 (2014)
R. Barends, J. Kelly, A. Veitia, A. Megrant, A. G. Fowler, “Rolling quantum dice with a superconducting qubit”, Phys. Rev. A, 90:3 (2014)
J.T.. Anderson, Guillaume Duclos-Cianci, David Poulin, “Fault-Tolerant Conversion between the Steane and Reed-Muller Quantum Codes”, Phys. Rev. Lett, 113:8 (2014)
Johan Åberg, “Catalytic Coherence”, Phys. Rev. Lett, 113:15 (2014)
J.J. Wallman, S.T. Flammia, “Randomized benchmarking with confidence”, New J. Phys, 16:10 (2014), 103032
M.K.. Gupta, M.M.. Wilde, “Multiplicativity of Completely Bounded p-Norms Implies a Strong Converse for Entanglement-Assisted Capacity”, Commun. Math. Phys, 2014
T. Cooney, M. Junge, C. Palazuelos, D. Pérez-García, “Rank-one quantum games”, comput. complex, 2014
Keisuke Fujii, Makoto Negoro, Nobuyuki Imoto, Masahiro Kitagawa, “Measurement-Free Topological Protection Using Dissipative Feedback”, Phys. Rev. X, 4:4 (2014)
Tomasz Kaftal, Rafał Demkowicz-Dobrzański, “Usefulness of an enhanced Kitaev phase-estimation algorithm in quantum metrology and computation”, Phys. Rev. A, 90:6 (2014)
Filippo Caruso, Vittorio Giovannetti, Cosmo Lupo, Stefano Mancini, “Quantum channels and memory effects”, Rev. Mod. Phys, 86:4 (2014), 1203
Gupta M.K., Wilde M.M., “Strong Converse For Entanglement-Assisted Capacity”, IEEE International Symposium on Information Theory, IEEE, 2014, 716–720
Berta M., Renes J.M., Wilde M.M., “Identifying the Information Gain of a Quantum Measurement”, IEEE Trans. Inf. Theory, 60:12 (2014), 7987–8006
Paetznick A., Svore K.M., “Repeat-Until-Success: Non-Deterministic Decomposition of Single-Qubit Unitaries”, Quantum Inform. Comput., 14:15-16 (2014), 1277–1301
Gottesman D., “Fault-Tolerant Quantum Computation With Constant Overhead”, Quantum Inform. Comput., 14:15-16 (2014), 1338–1371
Falci G., Paladino E., “The Physics of Quantum Computation”, Int. J. Quantum Inf., 12:4 (2014), 1430003
Devitt S.J., “Classical Control of Large-Scale Quantum Computers”, Reversible Computation, Lecture Notes in Computer Science, 8507, eds. Yamashita S., Minato S., Springer Int Publishing Ag, 2014, 26–39
Péter Pál Varjú, “Random walks in Euclidean space”, Ann. Math, 2015, 243
Y. S. Nam, R. Blümel, “Structural stability of the quantum Fourier transform”, Quantum Inf Process, 2015
Marco Piani, John Watrous, “Necessary and Sufficient Quantum Information Characterization of Einstein-Podolsky-Rosen Steering”, Phys. Rev. Lett, 114:6 (2015)
M. Ringbauer, C. J. Wood, K. Modi, A. Gilchrist, A. G. White, “Characterizing Quantum Dynamics with Initial System-Environment Correlations”, Phys. Rev. Lett, 114:9 (2015)
Stefanie Barz, “Quantum computing with photons: introduction to the circuit model, the one-way quantum computer, and the fundamental principles of photonic experiments”, J. Phys. B: At. Mol. Opt. Phys, 48:8 (2015), 083001
Sh.X.. Cui, Zhenghan Wang, “Universal quantum computation with metaplectic anyons”, J. Math. Phys, 56:3 (2015), 032202
Wei Qin, Chuan Wang, Xiangdong Zhang, “Protected quantum-state transfer in decoherence-free subspaces”, Phys. Rev. A, 91:4 (2015)
Aleksander Kubica, M.E.. Beverland, “Universal transversal gates with color codes: A simplified approach”, Phys. Rev. A, 91:3 (2015)
B.M.. Terhal, “Quantum error correction for quantum memories”, Rev. Mod. Phys, 87:2 (2015), 307
Guillaume Duclos-Cianci, David Poulin, “Reducing the quantum-computing overhead with complex gate distillation”, Phys. Rev. A, 91:4 (2015)
Ya.S.. Weinstein, “Syndrome measurement strategies for the [[7,1,3]] code”, Quantum Inf Process, 2015
D.J. Williamson, S.D. Bartlett, “Symmetry-protected adiabatic quantum transistors”, New J. Phys, 17:5 (2015), 053019
Rotem Arnon-Friedman, Renato Renner, “de Finetti reductions for correlations”, J. Math. Phys, 56:5 (2015), 052203
G.C.. Knee, W.J.. Munro, “Optimal Trotterization in universal quantum simulators under faulty control”, Phys. Rev. A, 91:5 (2015)
M.R.. Geller, J.M.. Martinis, A.T.. Sornborger, Ph.C.. Stancil, E.J.. Pritchett, “Universal quantum simulation with prethreshold superconducting qubits: Single-excitation subspace method”, Phys. Rev. A, 91:6 (2015)
Zbigniew Puchała, Anna Jenčová, Michal Sedlák, Mário Ziman, “Exploring boundaries of quantum convex structures: Special role of unitary processes”, Phys. Rev. A, 92:1 (2015)
A.W.. Cross, Graeme Smith, J.A.. Smolin, “Quantum learning robust against noise”, Phys. Rev. A, 92:1 (2015)
A.D.. Bookatz, Edward Farhi, Leo Zhou, “Error suppression in Hamiltonian-based quantum computation using energy penalties”, Phys. Rev. A, 92:2 (2015)
Wei T.-Ch., Liang J.C., “Hamiltonian Quantum Computer in One Dimension”, Phys. Rev. A, 92:6 (2015), 062334
Wallman J., Granade Ch., Harper R., Flammia S.T., “Estimating the Coherence of Noise”, New J. Phys., 17 (2015), 113020
Khezri M., Dressel J., Korotkov A.N., “Qubit Measurement Error From Coupling With a Detuned Neighbor in Circuit Qed”, Phys. Rev. A, 92:5 (2015), 052306
Nam Yu.S., Biuemel R., “Performance Scaling of the Quantum Fourier Transform With Defective Rotation Gates”, Quantum Inform. Comput., 15:9-10 (2015), 721–736
Arunachalam S., Johnston N., Russo V., “Is Absolute Separability Determined By the Partial Transpose?”, Quantum Inform. Comput., 15:7-8 (2015), 694–720
Polian I., Fowler A.G., 2015 52Nd Acm/Edac/IEEE Design Automation Conference (Dac), Design Automation Conference Dac, IEEE Computer Soc, 2015
Prokopenya A.N., “Approximate Quantum Fourier Transform and Quantum Algorithm For Phase Estimation”, Computer Algebra in Scientific Computing (Casc 2015), Lecture Notes in Computer Science, 9301, eds. Gerdt V., Koepf W., Seiler W., Vorozhtsov E., Springer Int Publishing Ag, 2015, 391–405
Fowler A.G., “Polyestimate: a Library For Near-Instantaneous Surface Code Analysis”, Quantum Inform. Comput., 15:1-2 (2015), 134–144
Fowler A.G., “Minimum Weight Perfect Matching of Fault-Tolerant Topological Quantum Error Correction in Average O(1) Parallel Time”, Quantum Inform. Comput., 15:1-2 (2015), 145–158
Selinger P., “Efficient Clifford Plus T Approximation of Single-Qubit Operators”, Quantum Inform. Comput., 15:1-2 (2015), 159–180
Weinstein Y.S., “How Often Must We Apply Syndrome Measurements?”, Proceedings of Spie, 9500, eds. Donkor E., Pirich A., Hayduk M., Spie-Int Soc Optical Engineering, 2015, 95000Q
Sanders Yu.R., Wallman J.J., Sanders B.C., “Bounding quantum gate error rate based on reported average fidelity”, New J. Phys., 18 (2015), 012002
Chailloux A., Kerenidis I., Rosgen B., “Quantum Commitments From Complexity Assumptions”, Comput. Complex., 25:1 (2016), 103–151
Mohseninia R., “Thermal stability of the two-dimensional topological color code”, Phys. Rev. A, 94:2 (2016), 022306
Bae J., Chruscinski D., “Operational Characterization of Divisibility of Dynamical Maps”, Phys. Rev. Lett., 117:5 (2016), 050403
Sawaya N.P.D., Smelyanskiy M., McClean J.R., Aspuru-Guzik A., “Error Sensitivity to Environmental Noise in Quantum Circuits for Chemical State Preparation”, J. Chem. Theory Comput., 12:7 (2016), 3097–3108
Breuckmann N.P., Terhal B.M., “Constructions and Noise Threshold of Hyperbolic Surface Codes”, IEEE Trans. Inf. Theory, 62:6 (2016), 3731–3744
Cedzich C., Grunbaum F.A., Stahl C., Velazquez L., Werner A.H., Werner F., “Bulk-edge correspondence of one-dimensional quantum walks”, J. Phys. A-Math. Theor., 49:21 (2016), 21LT01
Jencova A., Plavala M., “Conditions for optimal input states for discrimination of quantum channels”, J. Math. Phys., 57:12 (2016), 122203
Wallman J.J., Emerson J., “Noise tailoring for scalable quantum computation via randomized compiling”, Phys. Rev. A, 94:5 (2016), 052325
Bombin H., “Resilience to Time-Correlated Noise in Quantum Computation”, Phys. Rev. X, 6:4 (2016), 041034
Brown B.J., Loss D., Pachos J.K., Self Ch.N., Wootton J.R., “Quantum memories at finite temperature”, Rev. Mod. Phys., 88:4 (2016), 045005
Kueng R., Long D.M., Doherty A.C., Flammia S.T., “Comparing Experiments to the Fault-Tolerance Threshold”, Phys. Rev. Lett., 117:17 (2016), 170502
Dehollain J.P., Muhonen J.T., Blume-Kohout R., Rudinger K.M., Gamble J.K., Nielsen E., Laucht A., Simmons S., Kalra R., Dzurak A.S., Morello A., “Optimization of a solid-state electron spin qubit using gate set tomography”, New J. Phys., 18 (2016), 103018
Chung H.W., Guha S., Zheng L., “Superadditivity of Quantum Channel Coding Rate With Finite Blocklength Joint Measurements”, IEEE Trans. Inf. Theory, 62:10 (2016), 5938–5959
Blumoff J.Z., Chou K., Shen C., Reagor M., Axline C., Brierley R.T., Silveri M.P., Wang C., Vlastakis B., Nigg S.E., Frunzio L., Devoret M.H., Jiang L., Girvin S.M., Schoelkopf R.J., “Implementing and Characterizing Precise Multiqubit Measurements”, Phys. Rev. X, 6:3 (2016), 031041
Yoder T.J., Takagi R., Chuang I.L., “Universal Fault-Tolerant Gates on Concatenated Stabilizer Codes”, Phys. Rev. X, 6:3 (2016), 031039
Solenov D., “Coherent Modification of Entanglement: Benefits Due To Extended Hilbert Space”, Quantum Inform. Comput., 16:11-12 (2016), 954–968
Bermejo-Vega J., Lin C.Y.-Yu., Van den Nest M., “Normalizer Circuits and a Gottesman-Knill Theorem For Infinite-Dimensional Systems”, Quantum Inform. Comput., 16:5-6 (2016), 361–422
Polanco C., Buhse T., Uversky V.N., “Structure and function relationships of proteins based on polar profile: a review”, Acta Biochim. Pol., 63:2 (2016), 229–233
Berta M., Fawzi O., Scholz V.B., “Quantum-Proof Randomness Extractors via Operator Space Theory”, IEEE Trans. Inf. Theory, 63:4 (2017), 2480–2503
Puzzuoli D., Watrous J., “Ancilla Dimension in Quantum Channel Discrimination”, Ann. Henri Poincare, 18:4 (2017), 1153–1184
Yu N., Duan R., Xu Q., “Bounds on the Distance Between a Unital Quantum Channel and the Convex Hull of Unitary Channels”, IEEE Trans. Inf. Theory, 63:2 (2017), 1299–1310
Rong X., Lu D., Kong X., Geng J., Wang Ya., Shi F., Duan C.-K., Du J., “Harnessing the power of quantum systems based on spin magnetic resonance: from ensembles to single spins”, Adv. Phys.-X, 2:1 (2017), 125–168
Babu Hafiz Md. Hasan, “Cost-efficient design of a quantum multiplier–accumulator unit”, Quantum Inf. Process., 16:1 (2017), UNSP 30
Chamberland Ch., Jochym-O'Connor T., Laflamme R., “Overhead analysis of universal concatenated quantum codes”, Phys. Rev. A, 95:2 (2017)
Gao X., Wang Sh.-T., Duan L.-M., “Quantum Supremacy for Simulating a Translation-Invariant Ising Spin Model”, Phys. Rev. Lett., 118:4 (2017), 040502

Просмотров:
Эта страница:	3470
Полный текст:	988
Литература:	105
Первая стр.:	3

Что такое QR-код?

Обратная связь:

Пользовательское соглашение

Регистрация

Логотипы