Modeling superconducting quantum circuit systems

1. A computer-implemented simulation method comprising:

generating, by operation of a graph generating unit executed by one or more processors, a graph representing a quantum circuit system, wherein the graph includes vertices and edges, the edges representing circuit elements of the quantum circuit system and the vertices representing physical connections between the circuit elements of the quantum circuit system;

storing the graph in first memory;

assigning, to the graph stored in the first memory, inverse inductances, conductances, capacitances, and junction inverse inductances to respective edges of the graph based on a lumped-element approximation of the quantum circuit system;

providing a system of equations of motion representing current in the quantum circuit system;

generating, by operation of a tree generating unit executed by the one or more processors, a spanning tree based on the graph;

storing the spanning tree in second memory;

generating a matrix representation of the system of equations of motion based on the spanning tree; and

simulating the quantum circuit system based on the matrix representation.

2. The method of claim 1 , wherein the spanning tree comprises the subset of the edges of the graph having at least one of (i) inverse inductances that are non-zero or (ii) junction inverse inductances that are non-zero.

3. The method of claim 1 , wherein generating the spanning tree based on the graph comprises:

assigning, by operation of the tree generating unit, one of the vertices as a root of the graph, the root corresponding to a voltage ground of the quantum circuit system; and

assigning, based on the root, respective directions to the subset of edges of the spanning tree.

4. The method of claim 3 , wherein generating the spanning tree based on the graph further comprises performing a breadth-first traversal of the graph from the root.

5. The method of claim 1 , wherein the circuit elements comprise one of, or parallel combinations of two or more of, a capacitance, an inductance, a conductance, a Josephson junction, a current source, a voltage source and a sub-circuit.

6. The method of claim 1 , wherein assigning inverse inductances, conductances, capacitances, and junction inverse inductances to respective edges of the graph comprises assigning inverse inductances, conductances, capacitances, and junction inverse inductances to respective edges of the graph based on a physical measurement of the quantum circuit system.

7. The method of claim 1 , further comprising determining (i) an operating frequency, (ii) a dispersive shift, (iii) an anharmonicity, (iv) a coherence time shift, (v) a lamb shift, or (vi) a decay rate of the quantum circuit system based on the simulation of the quantum circuit system.

8. The method of claim 1 , further comprising determining a transfer function of the quantum circuit system based on the simulation of the quantum circuit system.

9. The method of claim 1 , wherein simulating the quantum circuit system based on the matrix representation further comprises simulating quantum dynamics of the quantum circuit system based on a Lindblad master equation.

10. The method of claim 1 , wherein simulating the quantum circuit system based on the matrix representation further comprises solving a Hamiltonian of a static quantum circuit system.

11. The method of claim 1 , wherein simulating the quantum circuit system comprises determining complex eigenmodes, eigenvectors, and eigenvalues of the quantum circuit system.

12. The method of claim 1 , further comprising determining resonant frequencies of the quantum circuit system based on the simulation of the quantum circuit system.

13. A computer-implemented simulation method comprising:

generating, by operation of a graph generating unit executed by one or more processors, a graph representing a quantum circuit system, wherein the graph includes vertices and edges, the edges representing circuit elements of the quantum circuit system and the vertices representing physical connections between the circuit elements of the quantum circuit system;

assigning, to the graph, inverse inductances, conductances, capacitances, and junction inverse inductances to respective edges of the graph based on a lumped-element approximation of the quantum circuit system;

determining, by operation of a coordinate generating unit executed by the one or more processors, a coordinate system based on the graph;

generating a matrix representation of the quantum circuit system based on the coordinate system;

determining a Hamiltonian for the quantum circuit system using the matrix representation; and

simulating the quantum circuit system based on the Hamiltonian.

14. The method of claim 13 , wherein the coordinate system comprises an arbitrary set of independent coordinates.

15. The method of claim 13 , wherein the lumped-element approximation of the quantum circuit system comprises a lossless linear system approximation of the quantum circuit system in which non-linearities are ignored.

16. The method of claim 15 , wherein simulating the quantum circuit system comprises diagonalizing the Hamiltonian.

17. The method of claim 15 , wherein simulating the quantum circuit system comprises determining eigenmodes, eigenvectors, and eigenvalues of the quantum circuit system.

18. The method of claim 13 , wherein the lumped-element approximation of the quantum circuit system comprises a lossy non-linear system approximation of the quantum circuit system.

19. The method of claim 18 , wherein simulating the quantum circuit system comprises:

quantizing the Hamiltonian to generate a first modified Hamiltonian;

including Josephson junction tunneling energies in the Hamiltonian to generate a second modified Hamiltonian; and

generating a Lindblad master equation based on the second modified Hamiltonian.

20. A non-transitory computer-readable medium storing computer-executable instructions which, when executed by one or more processors, cause the one or more processors to perform operations comprising:

generating a graph representing a quantum circuit system, wherein the graph includes vertices and edges, the edges representing circuit elements of the quantum circuit system and the vertices representing physical connections between the circuit elements of the quantum circuit system;

assigning, to the graph, inverse inductances, conductances, capacitances, and junction inverse inductances to respective edges of the graph based on a lumped-element approximation of the quantum circuit system;

determining a coordinate system based on the graph;

generating a matrix representation of the system based on the coordinate system;

determining a Hamiltonian for the quantum circuit system using the matrix representation; and

simulating the quantum circuit system based on the Hamiltonian.

21. The non-transitory computer-readable medium of claim 20 , wherein the coordinate system comprises an arbitrary set of independent coordinates.

22. The non-transitory computer-readable medium of claim 20 , wherein the computer-executable instructions to determine the coordinate system comprise computer-executable instructions to perform operations comprising:

generating a spanning tree based on the graph;

assigning one of the vertices as a root of the graph, the root corresponding to a voltage ground of the quantum circuit system; and

assigning, based on the root, respective directions to the subset of edges of the spanning tree.

23. The non-transitory computer-readable medium of claim 22 , wherein the spanning tree comprises the subset of the edges of the graph having at least one of (i) inverse inductances that are non-zero or (ii) junction inverse inductances that are non-zero.

24. The non-transitory computer-readable medium of claim 22 , wherein the computer-executable instructions to generate the spanning tree based on the graph comprise computer-executable instructions to perform a breadth-first traversal of the graph from the root.

25. The non-transitory computer-readable medium of claim 20 , wherein the lumped-element approximation of the quantum circuit system comprises a lossless linear system approximation of the quantum circuit system in which non-linearities are ignored.

26. The non-transitory computer-readable medium of claim 25 , wherein the computer-executable instructions to simulate the quantum circuit system based on the Hamiltonian comprise computer-executable instructions to diagonalize the Hamiltonian.

27. The non-transitory computer-readable medium of claim 25 , wherein the computer-executable instructions to simulate the quantum circuit system based on the Hamiltonian comprise computer-executable instructions to determine eigenmodes, eigenvectors, and eigenvalues of the quantum circuit system.

28. The non-transitory computer-readable medium of claim 19 , wherein the lumped-element approximation of the quantum circuit system comprises a lossy non-linear system approximation of the quantum circuit system.

29. The non-transitory computer-readable medium of claim 28 , wherein the computer-executable instructions to simulate the quantum circuit system based on the Hamiltonian further comprise computer-executable instructions to:

quantize the Hamiltonian to generate a first modified Hamiltonian;

include Josephson junction tunneling energies in the Hamiltonian to generate a second modified Hamiltonian; and

generate a Lindblad master equation based on the second modified Hamiltonian.

30. A computer system comprising:

memory that stores computer-executable instructions; and

one or more processors configured to access the memory, wherein the one or more processors are configured to execute the computer-executable instructions to:

generate a graph representing a quantum circuit system, wherein the graph includes vertices and edges, the edges representing circuit elements of the quantum circuit system and the vertices representing physical connections between the circuit elements of the quantum circuit system;

assign, to the graph, inverse inductances, conductances, capacitances, and junction inverse inductances to respective edges of the graph based on a lumped-element approximation of the quantum circuit system;

determine a coordinate system based on the graph;

generate a matrix representation of the system based on the coordinate system;

determine a Hamiltonian for the quantum circuit system using the matrix representation; and

simulate the quantum circuit system based on the Hamiltonian.

31. The computer system of claim 30 , wherein the coordinate system comprises an arbitrary set of independent coordinates.

32. The computer system of claim 30 , wherein the computer-executable instructions to determine the coordinate system comprise computer-executable instructions to:

generate a spanning tree based on the graph;

assign one of the vertices as a root of the graph, the root corresponding to a voltage ground of the quantum circuit system; and

assign, based on the root, respective directions to the subset of edges of the spanning tree.

33. The computer system of claim 32 , wherein the spanning tree comprises the subset of the edges of the graph having at least one of (i) inverse inductances that are non-zero or (ii) junction inverse inductances that are non-zero.

34. The computer system of claim 32 , wherein the computer-executable instructions to generate the spanning tree based on the graph comprises computer-executable instructions to perform a breadth-first traversal of the graph from the root.

35. The computer system of claim 30 , wherein the lumped-element approximation of the quantum circuit system comprises a lossless linear system approximation of the quantum circuit system in which non-linearities are ignored.

36. The computer system of claim 35 , wherein the computer-executable instructions to simulate the quantum circuit system based on the Hamiltonian comprise computer-executable instructions to diagonalize the Hamiltonian.

37. The computer system of claim 35 , wherein the computer-executable instructions to simulate the quantum circuit system based on the Hamiltonian comprise computer-executable instructions to determine eigenmodes, eigenvectors, and eigenvalues of the quantum circuit system.

38. The computer system of claim 30 , wherein the lumped-element approximation of the quantum circuit system comprises a lossy non-linear system approximation of the quantum circuit system.

39. The computer system of claim 38 , wherein the computer-executable instructions to simulate the quantum circuit system based on the Hamiltonian comprise computer-executable instructions to:

quantize the Hamiltonian to generate a first modified Hamiltonian;

include Josephson junction tunneling energies in the Hamiltonian to generate a second modified Hamiltonian; and

generate a Lindblad master equation based on the second modified Hamiltonian.