A common algebraic description for probabilistic and quantum computations

Martin Beaudry, José M. Fernandez, Markus Holzer

Type: Article

Publication Date: 2005-08-16

Citations: 4

DOI: https://doi.org/10.1016/j.tcs.2005.07.008

View Publication

Locations

arXiv (Cornell University) - View - PDF
Theoretical Computer Science - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	A Common Algebraic Description for Probabilistic and Quantum Computations	2004	Martin Beaudry José M. Fernandez Markus Holzer
+	General probabilistic theories for quantum foundations and quantum information	2008	Jonathan Barrett
+	An algebraic approach to quantum mechanics	1966	I. Montvay
+	Unification of classical and quantum probabilistic formalisms	2003	Andrei Khrennikov
+	Algorithmic Probability as a Common Foundation for Quantum Interpretation	2018	Allan F. Randall
+ PDF Chat	A probabilistic operator symbol framework for quantum information	2006	Margarita A. Man’ko V. I. Man’ko R. Vilela Mendes
+ PDF Chat	Probabilistic Process Algebra to Unifying Quantum and Classical Computing in Closed Systems	2019	Yong Wang
+ PDF Chat	Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations	2002	Masami Amano Kazuo Iwama Rudy Raymond
+	The Logico-Algebraic Approach to Quantum Mechanics	1975	C. A. Hooker
+	The Logico-Algebraic Approach to Quantum Mechanics	1979	C. A. Hooker
+	The Quantum Probability Calculus	1976	J. M. Jauch
+	The Quantum Probability Calculus	1977	J. M. Jauch
+	An algebraic approach to the Quantum Clebsch-Gordan formula	2018	John Z. Wu
+ PDF Chat	Advice Coins for Classical and Quantum Computation	2011	Scott Aaronson Andrew Drucker
+	Basic Concepts in Quantum Computation	2007	Artur Ekert Patrick Hayden Hitoshi Inamori
+	Quantum Register Algebra: the mathematical language for quantum computing	2023	Jaroslav Hrdina Dietmar Hildenbrand Aleš Návrat Christian J. Steinmetz Rafael Alves Carlile Lavor Petr Vašík Ivan Eryganov
+	Probabilistic foundations of general quantum theories and characterizations of representation space	1977	Guccione J Salvadore
+	An algebraic approach to quantum mechanics II	1966	I. Montvay
+ PDF Chat	Quantum logic and quantum computation	2007	Mladen Pavičić Norman D. Megill
+ PDF Chat	A Geometric Algebra Perspective on Quantum Computational Gates and Universality in Quantum Computing	2011	Carlo Cafaro Stefano Mancini

Works That Cite This (3)

Action	Title	Year	Authors
+	Interference versus success probability in quantum algorithms with imperfections	2008	Daniel Braun Bertrand Georgeot
+ PDF Chat	Distribution of interference in random quantum algorithms	2007	Ludovic Arnaud Daniel Braun
+ PDF Chat	Role of interference in quantum state transfer through spin chains	2007	Andriy O. Lyakhov Daniel Braun Christoph Bruder

Works Cited by This (14)

Action	Title	Year	Authors
+ PDF Chat	Two-bit gates are universal for quantum computation	1995	David P. DiVincenzo
+ PDF Chat	Strengths and Weaknesses of Quantum Computing	1997	Charles H. Bennett Ethan Bernstein Gilles Brassard Umesh Vazirani
+	The complexity of computing the permanent	1979	Leslie G. Valiant
+ PDF Chat	Multivalued logic gates for quantum computation	2000	Ashok Muthukrishnan C. R. Stroud
+	A complexity theory for feasible closure properties	1993	Mitsunori Ogiwara Lane A. Hemachandra
+	Gap-definable counting classes	1994	Stephen Fenner Lance Fortnow Stuart A. Kurtz
+ PDF Chat	Elementary gates for quantum computation	1995	Adriano Barenco Charles H. Bennett Richard Cleve David P. DiVincenzo Norman Margolus Peter W. Shor Tycho Sleator John A. Smolin Harald Weinfurter
+	A survey on counting classes	2002	T. Gundermannn N.A. Nasser Gerd Wechsung
+ PDF Chat	Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy	1999	Stephen Fenner Frederic Green Steven Homer Randall Pruim
+	The complexity of tensor calculus	2002	Carsten Damm Markus Holzer Pierre McKenzie