Related papers: Designing pretty good state transfer via isospectr…
We present a general method for finding loss-tolerant teleportation on large, entangled stabilizer states using only single-qubit measurements, known as \emph{stabilizer pathfinding} (SPF). For heralded loss, SPF is shown to generate…
In this manuscript we analyse generalised port-based teleportation (PBT) schemes, allowing for transmitting more than one unknown quantum state (or a composite quantum state) in one go, where the state ends up in several ports at Bob's…
Ultracold atoms can be used to perform quantum simulations of a variety of condensed matter systems, including spin systems. These progresses point to the implementation of the manipulation of quantum states and to observe and exploit the…
Quantum state transfer between distant nodes is at the heart of quantum processing and quantum networking. Stimulated by this, we propose a scheme where one can highly achieve quantum state transfer between sites in a cavity quantum…
The last decade has witnessed substantial interest in protocols for transferring information on networks of quantum mechanical objects. A variety of control methods and network topologies have been proposed, on the basis that transfer with…
Quantum state preparation (QSP) is a fundamental task in quantum computing and quantum information processing. It is critical to the execution of many quantum algorithms, including those in quantum machine learning. In this paper, we…
Port-based teleportation (PBT), introduced in 2008, is a type of quantum teleportation protocol which transmits the state to the receiver without requiring any corrections on the receiver's side. Evaluating the performance of PBT was…
Quantum state tomography (QST) is a widely employed technique for characterizing the state of a quantum system. However, it is plagued by two fundamental challenges: computational and experimental complexity grows exponentially with the…
Transferring quantum information between two qubits is a basic requirement for many applications in quantum communication and quantum information processing. In the iterative quantum state transfer (IQST) proposed by D. Burgarth et al.…
In this paper, we examine disorder (i.e. static imperfections in manufacture) for the fixed-Hamiltonian evolution protocol of quantum state transfer. We improve the performance by optimising the choice of Hamiltonian, and by implementing an…
The quantum Perfect State Transfer (PST) is a fundamental tool of quantum communication in a network. It is not easy to achieve in practice. The original idea of PST depends on the fundamentals of the continuous-time quantum walk. A path…
The local Hamiltonian problem consists of estimating the ground-state energy (given by the minimum eigenvalue) of a local quantum Hamiltonian. First, we show the existence of a good product-state approximation for the ground-state energy of…
Quantum state tomography (QST) is plagued by the ``curse of dimensionality'' due to the exponentially-scaled complexity in measurement and data post-processing. Efficient QST schemes for large-scale mixed states are currently missing. In…
We study the problem of sampling from and preparing quantum Gibbs states of local commuting Hamiltonians on hypercubic lattices of arbitrary dimension. We prove that any such Gibbs state which satisfies a clustering condition that we coin…
Quantum networks might enable quantum communication and distributed quantum computation. Solid-state defects are promising platforms for such networks, because they provide an optical interface for remote entanglement distribution and a…
A blow-up of $n$ copies of a graph $G$ is the graph $\overset{n}\uplus~G$ obtained by replacing every vertex of $G$ by an independent set of size $n$, where the copies of vertices in $G$ are adjacent in the blow-up if and only if the…
An oriented circulant graph is called integral if all eigenvalues of its Hermitian adjacency matrix are integers. The main purpose of this paper is to investigate the existence of perfect state transfer ($\PST$ for short) and multiple state…
We introduce a generalizable framework for learning to identify effective Hamiltonians directly from experimental data in solid-state quantum systems. Our approach is based on a physics-informed neural network architecture that embeds…
We present quantum-inspired algorithms for classification tasks inspired by the problem of quantum state discrimination. By construction, these algorithms can perform multiclass classification, prevent overfitting, and generate probability…
A continuous-time quantum random walk describes the motion of a quantum mechanical particle on an underlying graph. The graph itself is associated with a Hilbert space of dimension equal to the number of vertices. The dynamics of the walk…