Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Ezhov, A. Nifanova, D. Ventura (2000)
Quantum associative memory with distributed queriesInf. Sci., 128
G. Long, Yang Sun (2001)
Efficient scheme for initializing a quantum register with an arbitrary superposed statePhysical Review A, 64
Lov Grover (1996)
A fast quantum mechanical algorithm for database search
David Biron, O. Biham, E. Biham, M. Grassl, Daniel Lidar (1998)
Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution
George Viamontes, I. Markov, J. Hayes (2004)
Graph-based simulation of quantum computation in the density matrix representation, 5436
L. Schulman, U. Vazirani (1999)
Molecular scale heat engines and scalable quantum computation
D. Miller, M. Thornton (2006)
QMDD: A Decision Diagram Structure for Reversible and Quantum Circuits36th International Symposium on Multiple-Valued Logic (ISMVL'06)
David Rosenbaum, M. Perkowski (2009)
Extended superposed quantum-state initialization using disjoint prime implicantsPhysical Review A, 79
David Rosenbaum, M. Perkowski (2008)
Superposed Quantum State Initialization Using Disjoint Prime Implicants (SQUID)38th International Symposium on Multiple Valued Logic (ismvl 2008)
George Viamontes, M. Rajagopalan, I. Markov, J. Hayes (2002)
Gate-level simulation of quantum circuitsProceedings of the ASP-DAC Asia and South Pacific Design Automation Conference, 2003.
A. Abdollahi, Massoud Pedram (2006)
Analysis and Synthesis of Quantum Circuits by Using Quantum Decision DiagramsProceedings of the Design Automation & Test in Europe Conference, 1
D. Ventura, T. Martinez (1998)
Initializing the Amplitude Distribution of a Quantum StateFoundations of Physics Letters, 12
D. Ventura, T. Martinez (1998)
Quantum associative memoryInf. Sci., 124
Sofia Cassel (2012)
Graph-Based Algorithms for Boolean Function Manipulation
Binary superposed decision diagrams (BSQDDs) are a new type of quantum decision diagram that can be used for representing arbitrary quantum superpositions. One major advantage of BSQDDs is that they are dependent on the types of gates used in synthesis and a BSQDD can be used to efficiently generate a quantum array that will initialize the quantum superposition that the BSQDD represents. Transformation rules for BSQDDs allow BSQDDs to be reduced into simpler BSQDDs that represent the same quantum superposition. Canonical forms exist for a broad class of BSQDDs. This allows BSQDDs to be used for synthesizing quantum arrays that are capable of initializing arbitrary quantum superpositions.
Quantum Information Processing – Springer Journals
Published: Nov 12, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.