Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/9910053 · Fortschritte der Physik

Kirchhoff's Rule for Quantum Wires. II: The Inverse Problem with Possible Applications to Quantum Computers

Vadim V. Kostrykin, R. Schrader

Published Aug 1, 2000• 170 citations
arXivHTMLPDF

Abstract

In this article we continue our investigations of one particle quantum scattering theory for Schrödinger operators on a set of connected (idealized one-dimensional) wires forming a graph with an arbitrary number of open ends. The Hamiltonian is given as minus the Laplace operator with suitable linear boundary conditions at the vertices (the local Kirchhoff law). In “Kirchhoff's rule for quantum wires” [J. Phys. A: Math. Gen. 32, 595–630 (1999)] we provided an explicit algebraic expression for the resulting (on-shell) S-matrix in terms of the boundary conditions and the lengths of the internal lines and we also proved its unitarity. Here we address the inverse problem in the simplest context with one vertex only but with an arbitrary number of open ends. We provide an explicit formula for the boundary conditions in terms of the S-matrix at a fixed, prescribed energy. We show that any unitary n × n matrix may be realized as the S-matrix at a given energy by choosing appropriate (unique) boundary conditions. This might possibly be used for the design of elementary gates in quantum computing. As an illustration we calculate the boundary conditions associated to the unitary operators of some elementary gates for quantum computers and raise the issue whether in general the unitary operators associated to quantum gates should rather be viewed as scattering operators instead of time evolution operators for a given time associated to a quantum mechanical Hamiltonian. We also suggest an approach by which the S-matrix in our context may be obtained from “scattering experiments”, another aspect of the inverse problem. Finally we extend our previous discussion, how our approach is related to von Neumann's theory of selfadjoint extensions.

DOI
10.1002/1521-3978(200008)48:8<703::aid-prop703>3.0.co;2-o

Related papers

Kirchhoff's rule for quantum wires

Vadim V. Kostrykin, R. Schrader

We formulate and discuss one-particle quantum scattering theory on an arbitrary finite graph with n open ends and where we define the Hamiltonian to be (minus) the Laplace operator with general boundary conditions at the vertices. This results in a scattering theory with n channels. The corresponding on-shell S -matrix formed by the reflection and transmission amplitudes for incoming plane waves of energy E>0 is given explicitly in terms of the boundary conditions and the lengths of the internal lines. It is shown to be unitary, which may be viewed as the quantum version of Kirchhoff's law. We exhibit covariance and symmetry properties. It is symmetric if the boundary conditions are real. Also there is a duality transformation on the set of boundary conditions and the lengths of the internal lines such that the low-energy behaviour of one theory gives the high-energy behaviour of the transformed theory. Finally, we provide a composition rule by which the on-shell S -matrix of a graph is factorizable in terms of the S -matrices of its subgraphs. All proofs use only known facts from the theory of self-adjoint extensions, standard linear algebra, complex function theory and elementary arguments from the theory of Hermitian symplectic forms.

arXiv:math-ph/9806013•Journal of Physics A Mathematical and General•Jan 1, 1999•556 citations

Driven transparent quantum graphs

Jambul Yusupov, Matthias Ehrhardt, Kh. Sh. Matyokubov +1 more

Abstract In this paper, we discuss the concept of quantum graphs with transparent vertices by considering the case, where the graph interacts with an external time-independent field. In particular, we address the problem of transparent boundary conditions for quantum graphs, building on previous works on transparent boundary conditions for the stationary Schrödinger equation on a line. Physically relevant constraints that make the vertex transparent under boundary conditions in the form of (weight) continuity and Kirchhoff rules are derived using two approaches, where transparent boundary conditions for the time-independent Schrödinger equation are found. The latter is derived by extending the transparent boundary condition concept to the time-independent Schrödinger equation on driven quantum graphs. For the constant potential, these constraints are also obtained using the scattering approach. We also discuss how the eigenvalues and eigenfunctions of a quantum graph are influenced not only by its topology, but also by the shape/type of a potential when an external field is involved.

arXiv:2312.01448•Physica Scripta•Jun 3, 2025•8 citations

Design of Quantum Gates Using Quantum Scattering Theory

Harish Parthasarathy, Monika Aggarwal

Given two Hamiltonians \(H_0,H_1=H_0+V\) corresponding respectively to a free particle Hamiltonian and the free particle Hamiltonian plus its interaction energy with a scattering centre, we can compute the S-matrix, i.e., the matrix that determines the quantum mechanical amplitude of the process involving a particle coming from a free particle state at an infinite distance from the scattering centre at time \(t=-\infty\), entering into an initial scattered state, interacting with the scattering centre, entering into a final scattered state, and then escaping away to infinity at time \(t\rightarrow\infty\) to a final free particle state. Such amplitudes were first studied by Lippmann and Schwinger (Steven Weinberg, The Quantum Theory of Fields, Vol. 1, W.O. Amrein, Hilbert Space Methods in Quantum Mechanics) and then analyzed in a mathematically precise way by [T. Kato], [W. Amrein], and [K.B. Sinha]. In this paper, we first derive the Lippmann-Schwinger equation for the input and output scattered states in terms of the input and output free particle states using intuitive arguments originally due to Lippmann and Schwinger, and then, using rigorous operator theoretic arguments revolving around the spectral theorem for unbounded self-adjoint operators in a Hilbert space, we obtain an elegant formula for the scattering matrix elements in terms of the interaction potential and the free particle Hamiltonian between two free particle states corresponding to the same measure. We then discuss a computationally more efficient method based on the Dyson series expansion (Steven Weinberg, The Quantum Theory of Fields, Vol. 1), which works even in the case when the interaction Hamiltonian is time varying, in contrast to the Lippmann-Schwinger method, for calculating the S-matrix. We assume that the scattering potential, which can be time varying, can be controlled by incorporating control parameters and explain how the resulting unitary S-matrix can be made to approximate a given unitary gate in infinite-dimensional Hilbert space by optimizing the Hilbert-Schmidt/Frobenius norm distance between the given gate and the S-matrix gate, in which the latter is approximated by a truncated Dyson series. Of course, the S-matrix given by the Dyson series is a Taylor series functional expansion in the interaction potential and hence is a highly nonlinear function of the control parameters, and hence we propose numerical methods for such optimization. We then observe that if the control parameters are taken as random variables with joint moments, then the TPCP map involving statistical averaging of the adjoint action of the S-matrix acting on an initial mixed state w.r.t. the probability distribution of the control parameters will result in a final mixed state that is linear in the statistical moments of the control parameters, and hence optimization w.r.t. these moments can be easily carried out. Our method of TPCP map design is to optimize the sum of Frobenius distance squares between a sequence of desired output mixed states and the S-matrix based formula for the TPCP map acting on the corresponding input mixed states w.r.t. the statistical moments of the control parameters. We then generalize this method to include the case of TPCP maps obtained from the Hudson-Parthasarathy quantum noisy Schrödinger equation. In summary, we simulate the S-matrix gate for independent realizations of the control parameters having a probability distribution defined by their joint moments obtained by the above optimization procedure and apply the adjoint action of these independent S-matrices on a given input state, and take their ensemble average to obtain a good approximation to the action of the desired TPCP map on any given input state. This suggests that TPCP maps of arbitrarily large size can be realized using scattering experiments in the laboratory.

Qeios•Apr 16, 2024•0 citations

Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem

Joonas Ilmavirta, Matti J. Lassas, Jinpeng Lu +2 more

We consider an inverse problem for a finite graph $ (X, E) $ where we are given a subset of vertices $ B\subset X $ and the distances $ d_{(X, E)}(b_1, b_2) $ between all pairs of vertices $ b_1, b_2\in B $. The distance between vertices $ x_1, x_2\in X $ is defined as the minimal number of edges in paths connecting the vertices. This problem can be regarded as a discrete version of the boundary rigidity problem in Riemannian geometry or the inverse travel time problem in geophysics. We develop quantum computing methods to find a solution to the problem, and show that the solution is unique under certain conditions. We prove the following uniqueness result: when $ (X, E) $ is a tree and $ B $ is the set of leaves of the tree, the graph $ (X, E) $ is uniquely determined in the class of all connected graphs having a fixed number of vertices. We present a quantum algorithm which, under arbitrary conditions, produces the graph $ (X, E) $, or one of those, which has the given number of vertices and the required distances between vertices in $ B $. To this end we develop an algorithm that takes in a qubit representation of a graph and combine it with Grover's search algorithm. The algorithm can be implemented using only $ O(|X|^2) $ qubits, the same order as the number of elements in the adjacency matrix of $ (X, E) $, and it has a quadratic improvement in computational cost compared to standard classical algorithms. Finally, we consider applications in the theory of computation, and show that a slight modification of the inverse problem above is NP-complete: all NP-problems can be reduced to a discrete inverse problem that we consider.

arXiv:2306.05253•Inverse Problems and Imaging•Dec 5, 2024•1 citation

A star-graph model via operator extension

B. S. Pavlov

Abstract One usually assumes that the Schrödinger operator on a thin quantum network (“fattened graph”) can be simulated by the ordinary Schrödinger operator on the corresponding one-dimensional quantum graph. On the other hand, each quantum graph can be constructed of standard elements – star graphs. We prove that a thin star-shaped quantum network which consists of a compact domain and a few straight semi-infinite quantum wires, with a two-dimensional Schrödinger operator on it, can be simulated by the corresponding solvable model in form of a one-dimensional star graph: an outer space, with an ordinary Schrödinger operator on the leads, a resonance vertex supplied with an inner space and a finite matrix in it and an appropriate boundary condition connecting the inner and outer components of elements from the domain of the model. The model is (locally) quantitatively consistent: the scattering matrix of the model on a certain spectral interval serves an approximation of the scattering matrix of the network. The role of the constructed star-graph model as a “jump-start” in analytic perturbation procedure on continuous spectrum is discussed.

Mathematical Proceedings of the Cambridge Philosophical Society•Mar 1, 2007•20 citations

Universality in quantum computation

Jennifer L. Dodd

A quantum computer is similar to an ordinary computer, except that instead of bits it uses two-level quantum systems (qubits), and the usual logical operations on bits are replaced with noiseless quantum dynamics in the form of unitary gates or Hamiltonian interactions. Many sets of resources that are universal for quantum computation (that is, capable of implementing any quantum computation) have been found, but general conditions for universality are still only partially understood. Improving our understanding of these conditions contributes to two broad goals. On the one hand, understanding what class of physical systems is suitable for quantum computation allows us choose the systems that are most easily controlled or built in the laboratory. On the other hand, identifying the unifying characteristics of such a class provides insight into the fundamental physics responsible for the much greater computational power of quantum computers.        The original results presented in this thesis are a contribution to our understanding of the physical requirements for universal quantum computation. These results lead to the identification of a new, large class of universal dynamics. More specifically, the main problem that is addressed is the following: consider a physical system that is made up of a finite number of qubits that are subject to a natural, fixed interaction described by a two-body Hamiltonian. Suppose we have the ability to control the system only by applying fast one-qubit operations. Under what conditions is this system capable of universal quantum computation? The first original result of the thesis is to prove that universal quantum computation is possible under these conditions given the single extra constraint that the Hamiltonian must entangle, or connect, all of the qubits. In other words, since a two-body Hamiltonian is expressible as a sum of coupling terms each of which acts nontrivially on a pair of qubits, consider the graph whose vertices correspond to qubits and whose edges connect qubits that are coupled by a term in the Hamiltonian. Then this Hamiltonian, together with fast one-qubit unitaries, is universal for quantum computation precisely when the corresponding graph is connected.       This result suggests many potential generalizations, three of which are explored in this thesis. The first generalization is to show that the same result holds for a two-body Hamiltonian that acts on D-dimensional quantum systems (qudits), given fast one-qudit unitaries. A second extension is to the case of a many-body Hamiltonian, that is, a Hamiltonian that has coupling terms that act on more than two qubits. Again, we find that under mild restrictions, such Hamiltonians are universal provided they are connected and that arbitrary one-qubit unitaries are available. We also discover and explore some surprising structure in many-body Hamiltonians that is associated with the parity of the couplings. A third related problem that is addressed is the question of what two-qubit unitaries are universal for quantum computation. This problem was originally solved by J.-L. and R. Brylinski [BB02], who gave a technical proof of the universality of any two-qudit gate that is not the swap gate or a product of one-qudit unitaries, given one-qudit unitaries as a free resource. We develop an elementary and constructive proof for the case of qubits, and prove that our construction is very close to optimal in the number of uses of the two-qubit gate.       Given a qualitative understanding of what dynamical resources are universal for quantum computation, it is natural to consider developing a quantitative measure of the usefulness of quantum dynamics for quantum information processing. This is done in the final chapter of the thesis, in which the beginnings of a quantitative theory of quantum dynamics are developed.

•Jan 1, 2004•7 citations
In this article we continue our investigations of one particle quantum scattering theory for Schrödinger operators on a set of connected (idealized one-dimensional) wires forming a graph with an arbitrary number of open ends. The Hamiltonian is given as minus the Laplace operator with suitable linear boundary conditions at the vertices (the local Kirchhoff law). In “Kirchhoff's rule for quantum wires” [J. Phys. A: Math. Gen. 32, 595–630 (1999)] we provided an explicit algebraic expression for the resulting (on-shell) S-matrix in terms of the boundary conditions and the lengths of the internal lines and we also proved its unitarity. Here we address the inverse problem in the simplest context with one vertex only but with an arbitrary number of open ends. We provide an explicit formula for the boundary conditions in terms of the S-matrix at a fixed, prescribed energy. We show that any unitary n × n matrix may be realized as the S-matrix at a given energy by choosing appropriate (unique) boundary conditions. This might possibly be used for the design of elementary gates in quantum computing. As an illustration we calculate the boundary conditions associated to the unitary operators of some elementary gates for quantum computers and raise the issue whether in general the unitary operators associated to quantum gates should rather be viewed as scattering operators instead of time evolution operators for a given time associated to a quantum mechanical Hamiltonian. We also suggest an approach by which the S-matrix in our context may be obtained from “scattering experiments”, another aspect of the inverse problem. Finally we extend our previous discussion, how our approach is related to von Neumann's theory of selfadjoint extensions.
We formulate and discuss one-particle quantum scattering theory on an arbitrary finite graph with n open ends and where we define the Hamiltonian to be (minus) the Laplace operator with general boundary conditions at the vertices. This results in a scattering theory with n channels. The corresponding on-shell S -matrix formed by the reflection and transmission amplitudes for incoming plane waves of energy E>0 is given explicitly in terms of the boundary conditions and the lengths of the internal lines. It is shown to be unitary, which may be viewed as the quantum version of Kirchhoff's law. We exhibit covariance and symmetry properties. It is symmetric if the boundary conditions are real. Also there is a duality transformation on the set of boundary conditions and the lengths of the internal lines such that the low-energy behaviour of one theory gives the high-energy behaviour of the transformed theory. Finally, we provide a composition rule by which the on-shell S -matrix of a graph is factorizable in terms of the S -matrices of its subgraphs. All proofs use only known facts from the theory of self-adjoint extensions, standard linear algebra, complex function theory and elementary arguments from the theory of Hermitian symplectic forms.
Abstract In this paper, we discuss the concept of quantum graphs with transparent vertices by considering the case, where the graph interacts with an external time-independent field. In particular, we address the problem of transparent boundary conditions for quantum graphs, building on previous works on transparent boundary conditions for the stationary Schrödinger equation on a line. Physically relevant constraints that make the vertex transparent under boundary conditions in the form of (weight) continuity and Kirchhoff rules are derived using two approaches, where transparent boundary conditions for the time-independent Schrödinger equation are found. The latter is derived by extending the transparent boundary condition concept to the time-independent Schrödinger equation on driven quantum graphs. For the constant potential, these constraints are also obtained using the scattering approach. We also discuss how the eigenvalues and eigenfunctions of a quantum graph are influenced not only by its topology, but also by the shape/type of a potential when an external field is involved.
Given two Hamiltonians H0,H1=H0+VH_0,H_1=H_0+VH0​,H1​=H0​+V corresponding respectively to a free particle Hamiltonian and the free particle Hamiltonian plus its interaction energy with a scattering centre, we can compute the S-matrix, i.e., the matrix that determines the quantum mechanical amplitude of the process involving a particle coming from a free particle state at an infinite distance from the scattering centre at time t=−∞t=-\inftyt=−∞, entering into an initial scattered state, interacting with the scattering centre, entering into a final scattered state, and then escaping away to infinity at time t→∞t\rightarrow\inftyt→∞ to a final free particle state. Such amplitudes were first studied by Lippmann and Schwinger (Steven Weinberg, The Quantum Theory of Fields, Vol. 1, W.O. Amrein, Hilbert Space Methods in Quantum Mechanics) and then analyzed in a mathematically precise way by [T. Kato], [W. Amrein], and [K.B. Sinha]. In this paper, we first derive the Lippmann-Schwinger equation for the input and output scattered states in terms of the input and output free particle states using intuitive arguments originally due to Lippmann and Schwinger, and then, using rigorous operator theoretic arguments revolving around the spectral theorem for unbounded self-adjoint operators in a Hilbert space, we obtain an elegant formula for the scattering matrix elements in terms of the interaction potential and the free particle Hamiltonian between two free particle states corresponding to the same measure. We then discuss a computationally more efficient method based on the Dyson series expansion (Steven Weinberg, The Quantum Theory of Fields, Vol. 1), which works even in the case when the interaction Hamiltonian is time varying, in contrast to the Lippmann-Schwinger method, for calculating the S-matrix. We assume that the scattering potential, which can be time varying, can be controlled by incorporating control parameters and explain how the resulting unitary S-matrix can be made to approximate a given unitary gate in infinite-dimensional Hilbert space by optimizing the Hilbert-Schmidt/Frobenius norm distance between the given gate and the S-matrix gate, in which the latter is approximated by a truncated Dyson series. Of course, the S-matrix given by the Dyson series is a Taylor series functional expansion in the interaction potential and hence is a highly nonlinear function of the control parameters, and hence we propose numerical methods for such optimization. We then observe that if the control parameters are taken as random variables with joint moments, then the TPCP map involving statistical averaging of the adjoint action of the S-matrix acting on an initial mixed state w.r.t. the probability distribution of the control parameters will result in a final mixed state that is linear in the statistical moments of the control parameters, and hence optimization w.r.t. these moments can be easily carried out. Our method of TPCP map design is to optimize the sum of Frobenius distance squares between a sequence of desired output mixed states and the S-matrix based formula for the TPCP map acting on the corresponding input mixed states w.r.t. the statistical moments of the control parameters. We then generalize this method to include the case of TPCP maps obtained from the Hudson-Parthasarathy quantum noisy Schrödinger equation. In summary, we simulate the S-matrix gate for independent realizations of the control parameters having a probability distribution defined by their joint moments obtained by the above optimization procedure and apply the adjoint action of these independent S-matrices on a given input state, and take their ensemble average to obtain a good approximation to the action of the desired TPCP map on any given input state. This suggests that TPCP maps of arbitrarily large size can be realized using scattering experiments in the laboratory.
We consider an inverse problem for a finite graph $ (X, E) $ where we are given a subset of vertices $ B\subset X $ and the distances $ d_{(X, E)}(b_1, b_2) $ between all pairs of vertices $ b_1, b_2\in B $. The distance between vertices $ x_1, x_2\in X $ is defined as the minimal number of edges in paths connecting the vertices. This problem can be regarded as a discrete version of the boundary rigidity problem in Riemannian geometry or the inverse travel time problem in geophysics. We develop quantum computing methods to find a solution to the problem, and show that the solution is unique under certain conditions. We prove the following uniqueness result: when $ (X, E) $ is a tree and $ B $ is the set of leaves of the tree, the graph $ (X, E) $ is uniquely determined in the class of all connected graphs having a fixed number of vertices. We present a quantum algorithm which, under arbitrary conditions, produces the graph $ (X, E) $, or one of those, which has the given number of vertices and the required distances between vertices in $ B $. To this end we develop an algorithm that takes in a qubit representation of a graph and combine it with Grover's search algorithm. The algorithm can be implemented using only $ O(|X|^2) $ qubits, the same order as the number of elements in the adjacency matrix of $ (X, E) $, and it has a quadratic improvement in computational cost compared to standard classical algorithms. Finally, we consider applications in the theory of computation, and show that a slight modification of the inverse problem above is NP-complete: all NP-problems can be reduced to a discrete inverse problem that we consider.
Abstract One usually assumes that the Schrödinger operator on a thin quantum network (“fattened graph”) can be simulated by the ordinary Schrödinger operator on the corresponding one-dimensional quantum graph. On the other hand, each quantum graph can be constructed of standard elements – star graphs. We prove that a thin star-shaped quantum network which consists of a compact domain and a few straight semi-infinite quantum wires, with a two-dimensional Schrödinger operator on it, can be simulated by the corresponding solvable model in form of a one-dimensional star graph: an outer space, with an ordinary Schrödinger operator on the leads, a resonance vertex supplied with an inner space and a finite matrix in it and an appropriate boundary condition connecting the inner and outer components of elements from the domain of the model. The model is (locally) quantitatively consistent: the scattering matrix of the model on a certain spectral interval serves an approximation of the scattering matrix of the network. The role of the constructed star-graph model as a “jump-start” in analytic perturbation procedure on continuous spectrum is discussed.
A quantum computer is similar to an ordinary computer, except that instead of bits it uses two-level quantum systems (qubits), and the usual logical operations on bits are replaced with noiseless quantum dynamics in the form of unitary gates or Hamiltonian interactions. Many sets of resources that are universal for quantum computation (that is, capable of implementing any quantum computation) have been found, but general conditions for universality are still only partially understood. Improving our understanding of these conditions contributes to two broad goals. On the one hand, understanding what class of physical systems is suitable for quantum computation allows us choose the systems that are most easily controlled or built in the laboratory. On the other hand, identifying the unifying characteristics of such a class provides insight into the fundamental physics responsible for the much greater computational power of quantum computers.        The original results presented in this thesis are a contribution to our understanding of the physical requirements for universal quantum computation. These results lead to the identification of a new, large class of universal dynamics. More specifically, the main problem that is addressed is the following: consider a physical system that is made up of a finite number of qubits that are subject to a natural, fixed interaction described by a two-body Hamiltonian. Suppose we have the ability to control the system only by applying fast one-qubit operations. Under what conditions is this system capable of universal quantum computation? The first original result of the thesis is to prove that universal quantum computation is possible under these conditions given the single extra constraint that the Hamiltonian must entangle, or connect, all of the qubits. In other words, since a two-body Hamiltonian is expressible as a sum of coupling terms each of which acts nontrivially on a pair of qubits, consider the graph whose vertices correspond to qubits and whose edges connect qubits that are coupled by a term in the Hamiltonian. Then this Hamiltonian, together with fast one-qubit unitaries, is universal for quantum computation precisely when the corresponding graph is connected.       This result suggests many potential generalizations, three of which are explored in this thesis. The first generalization is to show that the same result holds for a two-body Hamiltonian that acts on D-dimensional quantum systems (qudits), given fast one-qudit unitaries. A second extension is to the case of a many-body Hamiltonian, that is, a Hamiltonian that has coupling terms that act on more than two qubits. Again, we find that under mild restrictions, such Hamiltonians are universal provided they are connected and that arbitrary one-qubit unitaries are available. We also discover and explore some surprising structure in many-body Hamiltonians that is associated with the parity of the couplings. A third related problem that is addressed is the question of what two-qubit unitaries are universal for quantum computation. This problem was originally solved by J.-L. and R. Brylinski [BB02], who gave a technical proof of the universality of any two-qudit gate that is not the swap gate or a product of one-qudit unitaries, given one-qudit unitaries as a free resource. We develop an elementary and constructive proof for the case of qubits, and prove that our construction is very close to optimal in the number of uses of the two-qubit gate.       Given a qualitative understanding of what dynamical resources are universal for quantum computation, it is natural to consider developing a quantitative measure of the usefulness of quantum dynamics for quantum information processing. This is done in the final chapter of the thesis, in which the beginnings of a quantitative theory of quantum dynamics are developed.