Skip to main content
Log in

Binary superposed quantum decision diagrams

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Abdaollahi, A., Pedram, M.: Analysis and synthesis of quantum circuits by using quantum decision diagrams. Design, Automation and Test in Europe (2006)

  2. Biron, D., Biham, O., Biham, E., Grassl, M., Lidar, D.A.: Generalized grover search algorithm for arbitrary initial amplitude distribution. Quantum Comput. Quantum Commun. 1509/1999, 140–147 (1999)

    Google Scholar 

  3. Bryant R.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comp. C-35, 677–691 (1986)

    Article  Google Scholar 

  4. Ezhov A., Nifanova, A., Ventura, D.: Quantum associative memory with distributed queries. Inf. Sci. (2000)

  5. Grover, L.: A fast quantum mechanical algorithm for database search. In: Annual ACM Symposium on Theory of Computing (1996)

  6. Long G., Sun Y.: Efficient scheme for initializing a quantum register with an arbitrary superposed state. Phys. Rev. A. 64, 014303 (2001)

    Article  ADS  Google Scholar 

  7. Miller, D., Thornton, M.: QMDD: A decision diagram structure for reversible and quantum circuits. In: IEEE International Symposium on Multiple Valued Logic (2006)

  8. Rosenbaum, D., Perkowski, M.: Superposed quantum state initialization using disjoint prime implicants. In: IEEE International Symposium on Multiple Valued Logic (2008)

  9. Rosenbaum D.J., Perkowski M.A.: Extended superposed quantum state initialization using disjoint prime implicants. Phys. Rev. A. 79, 052310 (2009)

    Article  MathSciNet  ADS  Google Scholar 

  10. Schulman, L., Vazirani, U.: Molecular scale heat engines and scalable quantum computation. In: Annual ACM Symposium on Theory of Computing (1999)

  11. Ventura D., Martinez T.: Initializing the amplitude distribution of a quantum state. Found. Phys. Lett. 12, 547–559 (1999)

    Article  MathSciNet  Google Scholar 

  12. Ventura D., Martinez T.: Quantum associative memory. Inf. Sci. 124, 273–296 (2000)

    Article  MathSciNet  Google Scholar 

  13. Viamontes G., Markov I., Hayes J.: Graph-based simulation of quantum computation in the density matrix representation. Quantum Inf. Comput. 5, 113–130 (2004)

    MathSciNet  Google Scholar 

  14. Viamontes, G., Rajagopalan, M., Markov, I., Hayes, J.: Gate-level simulation of quantum circuits. In: Conference on Asia South Pacific Design Automation (2003)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David Rosenbaum.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rosenbaum, D. Binary superposed quantum decision diagrams. Quantum Inf Process 9, 463–496 (2010). https://doi.org/10.1007/s11128-009-0153-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11128-009-0153-6

Keywords

PACS

Navigation