相关论文: On the uncomputability of the spectral gap
Quantum mechanics is widely regarded as a complete theory, yet we argue it is a tractable projection of a deeper, computationally-inaccessible classical variational structure. By analyzing the coupled partial differential equations of the…
We have proved new estimates for the coherent control errors of quantum circuits used in quantum computing. These estimates essentially take into account the commutator properties of the Hamiltonians and are based on the formulas of the…
We prove a general limitation in quantum information that unifies the impossibility principles such as no-cloning and no-anticloning. Further, we show that for an unknown qubit one cannot design a universal Hadamard gate for creating equal…
We present an example of an integrable Hamiltonian system with scalar potential in the three-dimensional Euclidean space whose integrals of motion are quadratic polynomials in the momenta, yet its Hamilton-Jacobi / Schrodinger equation…
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
We show that 2D fractal subsystem symmetry-protected topological phases may serve as resources for universal measurement-based quantum computation. This is demonstrated explicitly for two cluster models known to lie within fractal…
A semiclassical analysis based on spin-coherent states is used to establish a classification and formulae for the spectral gap of mean-field spin Hamiltonians. For gapped systems we provide a full description of the low-energy spectra based…
A quantum system subject to an external perturbation can experience leakage between uncoupled regions of its energy spectrum separated by a gap. To quantify this phenomenon, we present two complementary results. First, we establish…
We introduce a family of Hamiltonian systems for measurement-based quantum computation with continuous variables. The Hamiltonians (i) are quadratic, and therefore two body, (ii) are of short range, (iii) are frustration-free, and (iv)…
Is there any hope for quantum computing to challenge the Turing barrier, i.e. to solve an undecidable problem, to compute an uncomputable function? According to Feynman's '82 argument, the answer is {\it negative}. This paper re-opens the…
Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic…
Here is discussed the Hamiltonian approach to construction of deterministic universal (in approximate sense) programmable quantum circuits with qubits or any other quantum systems with dimension of Hilbert space is $n \ge 2$.
The field of quantum Hamiltonian complexity lies at the intersection of quantum many-body physics and computational complexity theory, with deep implications to both fields. The main object of study is the LocalHamiltonian problem, which is…
Quantum entanglement marks a definitive feature of topological states. However, the entanglement spectrum remains insufficiently explored for topological states without a bulk energy gap. Using a combination of field theory and numerical…
Integrable quantum computation is defined as quantum computing via the integrable condition, in which two-qubit gates are either nontrivial unitary solutions of the Yang--Baxter equation or the Swap gate (permutation). To make the…
Estimating spectral gaps of quantum many-body Hamiltonians is a highly challenging computational task, even under assumptions of locality and translation-invariance. Yet, the quest for rigorous gap certificates is motivated by their broad…
We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…
We explore in the framework of Quantum Computation the notion of {\em Computability}, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm for Hilbert's tenth problem, which is equivalent to…
In this brief paper we present some results on creating and manipulating spectral gaps for a (regular) quantum graph by inserting appropriate internal structures into its vertices. Complete proofs and extensions of the results are planned…