Chow‐Feng Chiang

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Efficient circuits for quantum walks	2010	Chow‐Feng Chiang Daniel Nagaj Paweł Wocjan

Common Coauthors

Coauthor	Papers Together
Daniel Nagaj	1
Paweł Wocjan	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Negative Examples for Sequential Importance Sampling of Binary Contingency Tables	2006	Ivona Bezáková Alistair Sinclair Daniel Štefankovič Eric Vigoda	1
+	Creating superpositions that correspond to efficiently integrable probability distributions	2002	Lov K. Grover Terry Rudolph	1
+ PDF Chat	Simulating quantum systems on a quantum computer	1998	Christof Zalka	1
+ PDF Chat	Quantum computation and decision trees	1998	Edward Farhi Sam Gutmann	1
+ PDF Chat	Efficient quantum circuits for arbitrary sparse unitaries	2009	Stephen P. Jordan Paweł Wocjan	1
+ PDF Chat	Speedup via quantum sampling	2008	Paweł Wocjan Anura Abeyesinghe	1
+ PDF Chat	Quantum Simulations of Classical Annealing Processes	2008	R. D. Somma Sergio Boixo Howard Barnum E. Knill	1
+	Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems	2008	Ivona Bezáková Daniel Štefankovič Vijay V. Vazirani Eric Vigoda	1
+ PDF Chat	Negative Examples for Sequential Importance Sampling of Binary Contingency Tables	2011	Ivona Bezáková Alistair Sinclair Daniel Štefankovič Eric Vigoda	1
+ PDF Chat	On the Relationship Between Continuous- and Discrete-Time Quantum Walk	2009	Andrew M. Childs	1
+ PDF Chat	Quantum algorithm for approximating partition functions	2009	Paweł Wocjan Chen-Fu Chiang Daniel Nagaj Anura Abeyesinghe	1
+ PDF Chat	Span-program-based quantum algorithm for evaluating formulas	2008	Ben W. Reichardt Robert Špalek	1
+	Simulated annealing in convex bodies and an <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math> volume algorithm	2005	László Lovász Santosh Vempala	1
+	A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries	2004	Mark Jerrum Alistair Sinclair Eric Vigoda	1
+ PDF Chat	Quantum Walk Algorithm for Element Distinctness	2004	Andris Ambainis	1
+	Introduction to Probability	2003		1
+ PDF Chat	Efficient Quantum Algorithms for Simulating Sparse Hamiltonians	2006	Dominic W. Berry Graeme Ahokas Richard Cleve Barry C. Sanders	1
+ PDF Chat	Quantum random walks: An introductory overview	2003	Julia Kempe	1