Related papers: Quantum graphs where back-scattering is prohibited
The methods of quantum cryptography enable one to have perfectly secure communication lines, whereby the laws of quantum physics protect the privacy of the data exchanged. Each quantum-cryptography scheme has its own security criteria that…
Only a few classes of quantum algorithms are known which provide a speed-up over classical algorithms. However, these and any new quantum algorithms provide important motivation for the development of quantum computers. In this article new…
We discuss scattering from pairs of isospectral quantum graphs constructed using the method described in [1, 2]. It was shown in [3] that scattering matrices of such graphs have the same spectrum and polar structure, provided that infinite…
We study the symmetry classes of graphene quantum dots, both open and closed, through the conductance and energy level statistics. For abrupt termination of the lattice, these properties are well described by the standard orthogonal and…
In this article 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…
The purpose of this paper is to make the theory of vertex algebras trivial. We do this by setting up some categorical machinery so that vertex algebras are just ``singular commutative rings'' in a certain category. This makes it easy to…
We suggest that a certain one-to-one parametrization of completely positive maps on the matrix algebra might be useful in the study of quantum channels. This is illustrated in the case of binary quantum channels. While the algorithm is…
We quantize the regularity properties of classical graphs that determine spin models for singly-generated Yang-Baxter planar algebras, including the Kauffman polynomial, and construct explicit examples. A source of examples comes from…
We examine quantum transport in periodic quantum graphs with a vertex coupling non-invariant with respect to time reversal. It is shown that the graph topology may play a decisive role in the conductivity properties illustrating this claim…
We study scattering quantum walks on highly symmetric graphs and use the walks to solve search problems on these graphs. The particle making the walk resides on the edges of the graph, and at each time step scatters at the vertices. All of…
We construct a new graph on 120 vertices whose quantum and classical independence numbers are different. At the same time, we construct an infinite family of graphs whose quantum chromatic numbers are smaller than the classical chromatic…
We develop a unified quantum framework for subgraph counting in graphs. We encode a graph on $N$ vertices into a quantum state on $2\lceil \log_2 N \rceil$ working qubits and $2$ ancilla qubits using its adjacency list, with worst-case gate…
We consider the inverse scattering problems for two types of Schr\"odinger operators on locally perturbed periodic lattices. For the discrete Hamiltonian, the knowledge of the S-matrix for all energies determines the graph structure and the…
In this paper, we construct the first families of asymmetric quantum convolutional codes (AQCC)'s. These new AQCC's are constructed by means of the CSS-type construction applied to suitable families of classical convolutional codes, which…
This paper provides a framework for the control of quantum mechanical systems with scattering states, i.e., systems with continuous spectra. We present the concept and prove a criterion of the approximate strong smooth controllability. Our…
In this paper we consider the possibility of application of the quantum inverse scattering method for studying the superconformal field theory and it's integrable perturbations. The classical limit of the considered constructions is based…
We calculate the S-matrix correlation function for chaotic scattering on quantum graphs and show that it agrees with that of random--matrix theory (RMT). We also calculate all higher S-matrix correlation functions in the Ericson regime.…
Quantum geometric maps, which relate SU(2) spin networks and Lorentz covariant projected spin networks, are an important ingredient of spin foam models (and tensorial group field theories) for 4-dimensional quantum gravity. We give a…
To any complex Hadamard matrix we associate a quantum permutation group. The correspondence is not one-to-one, but the quantum group encapsulates a number of subtle properties of the matrix. We investigate various aspects of the…
We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with $RX$ rotations and $RZZ$ entangling gates, corresponding to…