Existence of a Consistent Quantum Gravity Model from Minimum Microscopic Information

It is shown that a quantum gravity formulation exists on the basis of quantum number conservation, the laws of thermodynamics, unspecific interactions, and locally maximizing the ratio of resulting degrees of freedom per imposed degree of freedom of the theory. The First Law of thermodynamics is evaluated by imposing boundary conditions to the theory. These boundary conditions determine the details of the complex world structure. No explicite microscopic quantum structure is required, and thus no ambiguity arises on how to construct the model. Although no dynamical computations of quantum systems are possible on this basis, all well established physics may be recovered, and all measurable quantities may be computed. The recovery of physical laws is shown by extremizing the entropy, which means varying the action on the bulk and boundary of small volumes of curved space-time. It is sketched how Quantum Field Theory (QFT) and General Relativity (GR) are recovered with no further assumptions except for imposing the dimension of a second derivative of the metric on the gravitational field equations. The new concepts are 1. the abstract organization of statistical quantum states, allowing for the possibility of absent quantum microstructure, 2. the optimization of the locally resulting degrees of freedom per imposed degree of freedom of the theory, allowing for the reconstruction of the spacetime dimensions, 3. the reconstruction of physical and geometric quantities by means of stringent mathematical or physical justifications, 4. the fully general recovery of GR by quasi-local variation methods applied on small portions of spacetime.     

Families of Line-Graphs and Their Quantization

Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family L ⁿ (G). We give necessary and sufficient conditions for a line-graph to be quantisable and demonstrate that the spectra of associated quantum propagators follow the predictions of random matrices under very general conditions. Line-graphs may therefore serve as models to study the semiclassical limit (of large matrix size) of a quantum dynamics on graphs with fixed classical behaviour.     

Continuous-time quantum walks on star graphs

In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N-fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K₂ graphs (complete graph with two vertices) and the probability of observing walk tends to the uniform distribution.     

Deconstructing non-dissipative non-Dirac-Hermitian relativistic quantum systems

A method to construct non-dissipative non-Dirac-Hermitian relativistic quantum system that is isospectral with a Dirac-Hermitian Hamiltonian is presented. The general technique involves a realization of the basic canonical (anti-)commutation relations involving the Dirac matrices and the bosonic degrees of freedom in terms of non-Dirac-Hermitian operators, which are Hermitian in a Hilbert space that is endowed with a pre-determined positive-definite metric. Several examples of exactly solvable non-dissipative non-Dirac-Hermitian relativistic quantum systems are presented by establishing/employing a connection between Dirac equation and supersymmetry.     

Nondifferentiable Dynamic: Two Examples

Some nondifferentiable quantities (for example, the metric signature) can be the independent physical degrees of freedom. It is supposed that in quantum gravity these degrees of freedom can fluctuate. Two examples of such quantum fluctuation are considered: a quantum interchange of the sign of two components of the 5D metric and a quantum fluctuation between Euclidean and Lorentzian metrics. The first case leads to a spin-like structure on the throat of a composite wormhole and to a possible inner structure of the string. The second case leads to a quantum birth of the non-singular Euclidean Universe with frozen 5^th dimension. The probability for such quantum fluctuations is connected with an algorithmical complexity of the Einstein equations.     

Direct computation of scattering matrices for general quantum graphs

We present a direct and simple method for the computation of the total scattering matrix of an arbitrary finite noncompact connected quantum graph given its metric structure and local scattering data at each vertex. The method is inspired by the formalism of Reflection–Transmission algebras and quantum field theory on graphs though the results hold independently of this formalism. It yields a simple and direct algebraic derivation of the formula for the total scattering and has a number of advantages compared to existing recursive methods. The case of loops (or tadpoles) is easily incorporated in our method. This provides an extension of recent similar results obtained in a completely different way in the context of abstract graph theory. It also allows us to discuss briefly the inverse scattering problem in the presence of loops using an explicit example to show that the solution is not unique in general. On top of being conceptually very easy, the computational advantage of the method is illustrated on two examples of “three-dimensional” graphs (tetrahedron and cube) for which other methods are rather heavy or even impractical.     

Dimensional crossover of a Rabi-coupled two-component Bose–Einstein condensate in an optical lattice

Dimensionality is a central concept in developing the theory of low-dimensional physics.However,previous research on dimensional crossover in the context of a Bose-Einstein condensate(BEC) has focused on the single-component BEC.To our best knowledge,further consideration of the two-component internal degrees of freedom on the effects of dimensional crossover is still lacking.In this work,we are motivated to investigate the dimensional crossover in a three-dimensional(3D) Rabi-coupled two-compon...     

From CFT to graphs

In this paper, we pursue the discussion of the connections between rational conformal field theories (CFT) and graphs. We generalise our recent work on the relations of operator product algebra (OPA) structure constants of sl(2) theories with the Pasquier algebra attached to the graph. We show that in a variety of CFT's built on sl(n) (typically conformal embeddings and orbifolds), similar considerations enable one to write a linear system satisfied by the matrix elements of the Pasquier algebra in terms of conformal data (quantum dimensions and fusion coefficients). In some cases this provides sufficient information for the determination of all the eigenvectors of an adjacency matrix, and hence of a graph.     

Unboundedness of Adjacency Matrices of Locally Finite Graphs

Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note, we give an optimal condition to ensure it is also unbounded from below. We also consider the case of weighted graphs. We discuss the question of self-adjoint extensions and prove an optimal criterium.     

Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm

In papers [Jafarizadehn and Salimi, Ann. Phys. 322, 1005 (2007) and J. Phys. A: Math. Gen. 39, 13295 (2006)], the amplitudes of continuous-time quantum walk (CTQW) on graphs possessing quantum decomposition (QD graphs) have been calculated by a new method based on spectral distribution associated with their adjacency matrix. Here in this paper, it is shown that the CTQW on any arbitrary graph can be investigated by spectral analysis method, simply by using Krylov subspace-Lanczos algorithm to generate orthonormal bases of Hilbert space of quantum walk isomorphic to orthogonal polynomials. Also new type of graphs possessing generalized quantum decomposition (GQD) have been introduced, where this is achieved simply by relaxing some of the constrains imposed on QD graphs and it is shown that both in QD and GQD graphs, the unit vectors of strata are identical with the orthonormal basis produced by Lanczos algorithm. Moreover, it is shown that probability amplitude of observing the walk at a given vertex is proportional to its coefficient in the corresponding unit vector of its stratum, and it can be written in terms of the amplitude of its stratum. The capability of Lanczos-based algorithm for evaluation of CTQW on graphs (GQD or non-QD types), has been tested by calculating the probability amplitudes of quantum walk on some interesting finite (infinite) graph of GQD type and finite (infinite) path graph of non-GQD type, where the asymptotic behavior of the probability amplitudes at the limit of the large number of vertices, are in agreement with those of central limit theorem of [Phys. Rev. E 72, 026113 (2005)]. At the end, some applications of the method such as implementation of quantum search algorithms, calculating the resistance between two nodes in regular networks and applications in solid state and condensed matter physics, have been discussed, where in all of them, the Lanczos algorithm, reduces the Hilbert space to some smaller subspaces and the problem is investigated in the subspace with maximal dimension.     

Virtual quantum subsystems

The physical resources available to access and manipulate the degrees of freedom of a quantum system define the set A of operationally relevant observables. The algebraic structure of A selects a preferred tensor product structure, i.e., a partition into subsystems. The notion of compoundness for quantum systems is accordingly relativized. Universal control over virtual subsystems can be achieved by using quantum noncommutative holonomies     

Search algorithm on strongly regular graphs based on scattering quantum walks

Janmark, Meyer, and Wong showed that continuous-time quantum walk search on known families of strongly regular graphs(SRGs) with parameters(N, k, λ, μ) achieves full quantum speedup. The problem is reconsidered in terms of scattering quantum walk, a type of discrete-time quantum walks. Here, the search space is confined to a low-dimensional subspace corresponding to the collapsed graph of SRGs. To quantify the algorithm's performance, we leverage the fundamental pairing theorem, a general theory developed by Cottrell for quantum search of structural anomalies in star graphs.The search algorithm on the SRGs with k scales as N satisfies the theorem, and results can be immediately obtained, while search on the SRGs with k scales as√N does not satisfy the theorem, and matrix perturbation theory is used to provide an analysis. Both these cases can be solved in O(√N) time steps with a success probability close to 1. The analytical conclusions are verified by simulation results on two SRGs. These examples show that the formalism on star graphs can be applied more generally.     

Two-point versus multipartite entanglement in quantum phase transitions

We analyze correlations between subsystems for an extended Hubbard model exactly solvable in one dimension, which exhibits a rich structure of quantum phase transitions (QPTs). The T = 0 phase diagram is exactly reproduced by studying singularities of single-site entanglement. It is shown how comparison of the latter quantity and quantum mutual information allows one to recognize whether two-point or shared quantum correlations are responsible for each of the occurring QPTs. The method works in principle for any number D of degrees of freedom per site. As a by-product, we are providing a benchmark for direct measures of bipartite entanglement; in particular, here we discuss the role of negativity at the transition.     

Energy entanglement in neutron interferometry

Entanglement between degrees of freedom, namely between the spin, path and (total) energy degrees of freedom, for single neutrons is exploited. We implemented a triply entangled Greenberger-Horne-Zeilinger(GHZ)-like state and coherently manipulated relative phases of two-level quantum subsystems. An inequality derived by Mermin was applied to analyze the generated GHZ-like state: we determined the four expectation values and finally obtained M=2.558±0.004?2. This demonstrates the violation of a Mermin-like inequality for triply entangled GHZ-like state in a single-particle system, which, in turn, exhibits a clear inconsistency between noncontextual assumptions and quantum mechanics and confirms quantum contextuality.     

Transparent quantum graphs

We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrödinger equation on metric graphs. This allows to derive simple constraints, which make usual Kirchhoff-type boundary conditions at the vertex equivalent to the transparent ones. The approach is applied to quantum star and tree graphs. However, extension to more complicated graph topologies is rather straightforward.     

Measurement-device-independent quantum key distribution of multiple degrees of freedom of a single photon

Measurement-device-independent quantum key distribution(MDI-QKD)provides us a powerful approach to resist all attacks at detection side.Besides the unconditional security,people also seek for high key generation rate,but MDI-QKD has relatively low key generation rate.In this paper,we provide an efficient approach to increase the key generation rate of MDI-QKD by adopting multiple degrees of freedom(DOFs)of single photons to generate keys.Compared with other high-dimension MDI-QKD protocols encoding in one DOF,our protocol is more flexible,for our protocol generating keys in independent subsystems and the detection failure or error in a DOF not affecting the information encoding in other DOFs.Based on above features,our MDI-QKD protocol may have potential application in future quantum comniunication field.     

On Connected Diagrams and Cumulants of Erdős-Rényi Matrix Models

Regarding the adjacency matrices of n-vertex graphs and related graph Laplacian we introduce two families of discrete matrix models constructed both with the help of the Erdős-Rényi ensemble of random graphs. Corresponding matrix sums represent the characteristic functions of the average number of walks and closed walks over the random graph. These sums can be considered as discrete analogues of the matrix integrals of random matrix theory. We study the diagram structure of the cumulant expansions of logarithms of these matrix sums and analyze the limiting expressions as n → ∞ in the cases of constant and vanishing edge probabilities.     

初态对线型分子体系量子速度极限度量的影响

量子速度极限(QSL)的实用性研究关系到更高效量子技术的实现,研究不同分子体系中QSL问题可为基于分子体系的量子信息技术提供理论支持.采用代数方法讨论了不同的初始态对QSL度量方式的影响,研究发现初始态和分子参数均会影响QSL的度量方式,对分子体系无论Fock态还是相干态,量子Fisher信息度量方式优于Wigner-Yanase信息度量方式.广义几何QSL度量更适合描述强相干态下的分子动力学演化.     

Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix

Using the spectral distribution associated with the adjacency matrix of graphs, we introduce a new method of calculation of amplitudes of continuous-time quantum walk on some rather important graphs, such as line, cycle graph C_n, complete graph K_n, graph G_n, finite path and some other finite and infinite graphs, where all are connected with orthogonal polynomials such as Hermite, Laguerre, Tchebichef, and other orthogonal polynomials. It is shown that using the spectral distribution, one can obtain the infinite time asymptotic behavior of amplitudes simply by using the method of stationary phase approximation (WKB approximation), where as an example, the method is applied to star, two-dimensional comb lattices, infinite Hermite and Laguerre graphs. Also by using the Gauss quadrature formula one can approximate the infinite graphs with finite ones and vice versa, in order to derive large time asymptotic behavior by WKB method. Likewise, using this method, some new graphs are introduced, where their amplitudes are proportional to the product of amplitudes of some elementary graphs, even though the graphs themselves are not the same as the Cartesian product of their elementary graphs. Finally, by calculating the mean end to end distance of some infinite graphs at large enough times, it is shown that continuous-time quantum walk at different infinite graphs belong to different universality classes which are also different from those of the corresponding classical ones.