Related papers: Quantum-like product states constructed from class…
Quantum networks are promising tools for the implementation of long-range quantum communication. The characterization of quantum correlations in networks and their usefulness for information processing is therefore central for the progress…
Quantum networks lead to novel notions of locality and correlations and an important problem concerns the question of which quantum states can be experimentally prepared with a given network structure and devices and which not. We prove…
The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in…
Neuroscientists face challenges in analyzing high-dimensional neural recording data of dense functional networks. Without ground-truth reference data, finding the best algorithm for recovering neurologically relevant networks remains an…
Two sorts of bosons in an optical lattice at commensurate filling factors can form five stable superfluid and insulating groundstates with rich and non-trivial phase diagram. The structure of the groundstate diagram is established by…
The classical limit of quantum mechanics, formally investigated through frameworks like strict deformation quantization, remains a profound area of inquiry in the philosophy of physics. This paper explores a computational approach employing…
In a quantum computer, creating superpositions of quantum bits (qubits) in different states can lead to a speed-up over classical computers [1], but quantum mechanics also allows for the superposition of quantum circuits [2]. In fact, it…
Both the set of quantum states and the set of classical states described by symplectic tomographic probability distributions (tomograms) are studied. It is shown that the sets have common part but there exist tomograms of classical states…
Designing an operational architecture for the Quantum Internet is challenging in light of both fundamental limits imposed by physics laws and technological constraints. Here, we propose a method to abstract away most of the quantum-specific…
The geometrical description of a Hilbert space asociated with a quantum system considers a Hermitian tensor to describe the scalar inner product of vectors which are now described by vector fields. The real part of this tensor represents a…
A method for the implementation of a universal set of fault-tolerant logical gates is presented using homological product codes. In particular, it is shown that one can fault-tolerantly map between different encoded representations of a…
Using the signed laplacian matrix, and weighted and hybrid graphs, we present additional ways to interpret graphs as grid states. Hybrid graphs offer the most general interpretation. Existing graphical methods that characterize entanglement…
Understanding the boundary between classical simulatability and the power of quantum computation is a fascinating topic. Direct simulation of noisy quantum computation requires solving an open quantum many-body system, which is very costly.…
We consider the optimal approximation of certain quantum states of a harmonic oscillator with the superposition of a finite number of coherent states in phase space placed either on an ellipse or on a certain lattice. These scenarios are…
In the framework of deterministic finslerian models, a mechanism producing dissipative dynamics at the Planck scale is discussed. It is based on a geometric evolution from Finsler to Riemann structures defined on the fiber bundle ${ TM}\to…
In this paper, we extend past work done on the application of the mathematics of category theory to quantum information science. Specifically, we present a realization of a dagger-compact category that can model finite-dimensional quantum…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
As simulations of quantum systems cross the limits of classical computability, both quantum and classical approaches become hard to verify. Scaling predictions are therefore based on local structure and asymptotic assumptions, typically…
Quantum hypergraph states form a generalisation of the graph state formalism that goes beyond the pairwise (dyadic) interactions imposed by remaining inside the Gaussian approximation. Networks of such states are able to achieve…
The work discusses validation of properties of quantum circuits with many qubits using non-universal set of quantum gates ensuring possibility of effective simulation on classical computer. An understanding analogy between different models…