skip to main content
article

Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity

Published: 01 February 2002 Publication History

Abstract

We consider a quantum computer consisting of n spins with an arbitrary but fixed pair-interaction Hamiltonian and describe how to simulate other pair-interactions by interspersing the natural time evolution with fast local transformations. Calculating the minimal time overhead of such a simulation leads to a convex optimization problem. Lower and upper bounds on the minimal time overhead are derived in terms of chromatic indices of interaction graphs and spectral majorization criteria. These results classify Hamiltonians with respect to their computational power.
For a specific Hamiltonian, namely σz ⊗ σz-interactions between all spins, the optimization is mathematically equivalent to a separability problem of n-qubit density matrices. We compare the complexity defined by such a quantum computer with the usual gate complexity.

References

[1]
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge, 2000.
[2]
N. Duffleld, and R. Werner, Local dynamics of mean-field quantum systems, Helv. Phys. Acta, Vol. 95, pp. 1016-1054, 1992.
[3]
J. L. Dodd, M. A. Nielsen, M. J. Bremner, and R. T. Thew, Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries, quant-ph/0106064v2.
[4]
D. Janzing, P. Wocjan, and Th. Beth, Complexity of inverting n-spin interactions: Arrow of time in quantum control, quant-ph/0106085, 2001.
[5]
N. Khaneja, R. Brockett, and S. J. Glaser, Time optimal control in spin systems, Phys. Rev. A, Vol. 63, pp. 032308 1-13, 2001.
[6]
R. R. Ernst, G. Bodenhausen, and Wokaun A., Principles of nuclear magnetic resonance in one and two dimension, Clarendon Press, Oxford, 1987.
[7]
M. A. Nielsen, Conditions for a class of entanglement transformations, Phys. Rev. Lett., Vol. 83, pp. 436-439, 1999.
[8]
M. A. Nielsen, Characterizing mixing and measurements in quantum mechanics, quant-ph/0008073, 2000.
[9]
R. Bhatia, Matrix Analysis, Graduate texts in mathematics; 169, Springer, 1996.
[10]
D. Janzing and Th. Beth, Complexity measure for continuous time quantum algorithms, Phys. Rev. A, Vol. 64, pp. 022301 1-6, 2000, quant-ph/0009094.
[11]
D. W. Leung, I. L. Chuang, F. Yamaguchi, and Y. Yamamoto, Efficient implementation of coupled logic gates for quantum computing, Phys. Rev. A, Vol. 61, pp. 042310-0-7, 2000.
[12]
R. A. Horn, and C. R. Johnson, Matrix Analysis, Cambridge University Press, 1985.
[13]
B. Bollobás, Modern Graph Theory, Springer Verlag, 1998.
[14]
D. M. Cvetkovic, M. Doob, and H. Sachs, Spectra of Graphs: theory and applications, 3rd edition, Johann Ambrosius Barth Verlag, 1995.
[15]
W. D. Wallis, Guo-Hui Zhang, On the partition and coloring of a graph by cliques, Discrete Math. 120., No. 1-3, pp. 191-203, 1993.
[16]
J. A. Jones and E. Knill, E., Efficient Refocussing of One Spin and Two Spin Interactions for NMR Quantum Computation, J. Magn. Resonance, Vol. 141, pp. 323-325, 1999.

Cited By

View all
  1. Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Quantum Information & Computation
    Quantum Information & Computation  Volume 2, Issue 2
    February 2002
    84 pages

    Publisher

    Rinton Press, Incorporated

    Paramus, NJ

    Publication History

    Published: 01 February 2002
    Revised: 20 November 2001
    Received: 26 June 2001

    Author Tags

    1. chromatic index
    2. graph spectra
    3. quantum complexity
    4. quantum control theory
    5. simulating pair-interactions

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 06 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media