Related papers: Sensitivity of quantum PageRank
We build up a directed network tracing links from a given integer to its divisors and analyze the properties of the Google matrix of this network. The PageRank vector of this matrix is computed numerically and it is shown that its…
Hybrid quantum neural networks are increasingly explored for classification, yet it remains unclear how their performance and quantum behavior scale with circuit depth and qubit count. We present a controlled scaling study of hybrid…
We propose an approach to quantum computing in which quantum gate strengths are parametrized by quantum degrees of freedom, and the capability of the quantum computer to perform desired tasks is monitored and gradually improved by…
In general, a quantum algorithm wants to avoid decoherence or perturbation, since such factors may cause errors in the algorithm. In this letter, we will supply the answer to the interesting question: can the factors seemingly harmful to a…
Semi-supervised and unsupervised machine learning methods often rely on graphs to model data, prompting research on how theoretical properties of operators on graphs are leveraged in learning problems. While most of the existing literature…
The Internet is one of the most valuable technologies invented to date. Among them, Google is the most widely used search engine. The PageRank algorithm is the backbone of Google search, ranking web pages according to relevance and recency.…
A quantum trajectory describes the evolution of a quantum system undergoing indirect measurement. In the discrete-time setting, the state of the system is updated by applying Kraus operators according to the measurement results. From an…
Machine learning is a fascinating and exciting field within computer science. Recently, this excitement has been transferred to the quantum information realm. Currently, all proposals for the quantum version of machine learning utilize the…
We present a detailed study of the quantum site percolation problem on simple cubic lattices, thereby focussing on the statistics of the local density of states and the spatial structure of the single particle wavefunctions. Using the…
We address the problem of sensing the curvature of a manifold by performing measurements on a particle constrained to the manifold itself. In particular, we consider situations where the dynamics of the particle is quantum mechanical and…
I introduce rate-distortion theory for quantum coding, and derive a lower bound, involving the coherent information, on the rate at which qubits must be used to encode a quantum source with a given maximum level of distortion per source…
We introduce the concept of Quantum Ping (QPing) as a diagnostic primitive for future quantum networks, designed to assess whether two or more end nodes can establish practical quantum entanglement with efficient resource consumption,…
A satisfactory theory of quantum gravity may necessitate a drastic modification of our perception of space-time, by giving it a foamy structure at distances comparable to the Planck length. It is argued in this essay that the experimental…
A satisfactory theory of quantum gravity will very likely require modification of our classical perception of space-time, perhaps by giving it a 'foamy' structure at scales of order the Planck length. This is expected to modify the…
Quantum states of a few-particle system capacitively coupled to a metal gate can be discriminated by measuring the quantum capacitance, which can be identified with the second derivative of the system energy with respect to the gate…
The dynamics of the nuclear-spin quantum computer with large number (L=1000) of qubits is considered using a perturbation approach, based on approximate diagonalization of exponentially large sparse matrices. Small parameters are introduced…
Using periodic orbit theory, we evaluate the form factor of a quantum graph to which a very weak magnetic field is applied. The first correction to the diagonal approximation describing the transition between the universality classes is…
We report lowest-order series expansions for primary matrix functions of quantum states based on a perturbation theory for functions of linear operators. Our theory enables efficient computation of functions of perturbed quantum states that…
One of the main quests in quantum metrology, and quantum parameter estimation in general, is to find out the highest achievable precision with given resources and design schemes that attain that precision. In this article we present a…
Positive semidefinite rank (PSD-rank) is a relatively new quantity with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for…