相关论文: Quantum marginals, faces, and coatoms

In this paper, we deal with hamiltonicity in planar cubic graphs G having a facial 2-factor Q via (quasi) spanning trees of faces in G/Q and study the algorithmic complexity of finding such (quasi) spanning trees of faces. Moreover, we show…

We introduce an algorithm that is able to find the facets of Coulomb diamonds in quantum dot arrays. We simulate these arrays using the constant-interaction model, and rely only on one-dimensional raster scans (rays) to learn a model of the…

Subsystems of composite quantum systems are described by reduced density matrices, or quantum marginals. Important physical properties often do not depend on the whole wave function but rather only on the marginals. Not every collection of…

Computing the autotopism group of a partial Latin rectangle can be performed in a variety of ways. This pilot study has two aims: (a) to compare these methods experimentally, and (b) to identify the design goals one should have in mind for…

Combinatorial optimization is considered a promising class of problems in which quantum computers can show significant advantages. However, problems of practical relevance typically have more variables than current or foreseeable quantum…

We implement a hybrid quantum-classical model for image classification that compresses MNIST digit images into a low-dimensional feature space and then maps these features onto a 5-qubit quantum state. First, an autoencoder compresses each…

The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…

We examine the possible states of subsystems of a system of bits or qubits. In the classical case (bits), this means the possible marginal distributions of a probability distribution on a finite number of binary variables; we give necessary…

We present a framework for computing the solution to Hamiltonian eigenproblems in a subspace defined by bit-strings sampled from a quantum computer. Hamiltonians are represented using an extended alphabet that includes projection and ladder…

Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…

As is well known, qubits are the fundamental building blocks of quantum computers, and more generally, of quantum information. A major challenge in the development of quantum devices arises because the information content in any quantum…

Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…

Neural network approaches to approximate the ground state of quantum hamiltonians require the numerical solution of a highly nonlinear optimization problem. We introduce a statistical learning approach that makes the optimization trivial by…

Solving for the lowest energy eigenstate of the many-body Schrodinger equation is a cornerstone problem that hinders understanding of a variety of quantum phenomena. The difficulty arises from the exponential nature of the Hilbert space…

The study of gapped quantum many-body systems in three spatial dimensions has uncovered the existence of quantum states hosting quasiparticles that are confined, not by energetics but by the structure of local operators, to move along lower…

In this paper the local iterative Lie-Schwinger block-diagonalization method, introduced in [FP], [DFPR1], and [DFPR2] for quantum chains, is extended to higher-dimensional quantum lattice systems with Hamiltonians that can be written as…

The paper explores the basic geometrical properties of the observables characterizing two-qubit systems by employing a novel projective ring geometric approach. After introducing the basic facts about quantum complementarity and maximal…

In topological quantum computation, quantum information is stored in states which are intrinsically protected from decoherence, and quantum gates are carried out by dragging particle-like excitations (quasiparticles) around one another in…

We present the Quantum Hamiltonian Analysis Toolkit (QHAT), a newly developed application that provides a user-friendly interface for studying Hamiltonians and performing Hamiltonian simulation on fault-tolerant quantum computers. QHAT…

Lattice models or structures are geometrical objects with mathematical forms, that are used to represent physical systems. They have been used widely in diverse fields, namely, in condensed matter physics, to study degrees of freedom of…