Related papers: Topological Characterization with a Twist, Condens…
For successful realization of a quantum computer, its building blocks (qubits) should be simultaneously scalable and sufficiently protected from environmental noise. Recently, a novel approach to the protection of superconducting qubits has…
A major obstacle in the way of practical quantum computing is achieving scalable and robust high-fidelity entangling gates. To this end, quantum control has become an essential tool, as it can make the entangling interaction resilient to…
Short text clustering is a challenging problem due to its sparseness of text representation. Here we propose a flexible Self-Taught Convolutional neural network framework for Short Text Clustering (dubbed STC^2), which can flexibly and…
We run a numerical linked-cluster expansion with a quantum algorithm (NLCE+QA), computing ground-state energies and one quasi-particle dispersions in the thermodynamic limit using a 20-qubit trapped-ion quantum processing unit (QPU). The…
This paper suggests a [email protected] of composable specification of concurrent programs that permits: (1) verification of program code for a given specification, and (2) composition of the specifications of the components to yield…
A higher-order Suzuki-Trotter decomposition or Trotterization can be exploited to mitigate the Trotter error in digital quantum simulation. This work revisits the second-order symmetric Trotterization in terms of the Trotter error, where…
Communication networks form the backbone of our society. Topology control algorithms optimize the topology of such communication networks. Due to the importance of communication networks, a topology control algorithm should guarantee…
A network of optical parametric oscillators is used to simulate classical Ising and XY spin chains. The collective nonlinear dynamics of this network, driven by quantum noise rather than thermal fluctuations, seeks out the Ising / XY ground…
Topologically ordered phases of matter display a number of unique characteristics, including ground states that can be interpreted as patterns of closed strings. In this paper, we consider the problem of detecting and distinguishing closed…
Topological quantum codes are intrinsically fault-tolerant to local noise, and underlie the theory of topological phases of matter. We explore geometry to enhance the performance of topological quantum codes by rotating the four dimensional…
We show how combining a discrete symmetry with topological Hilbert space fragmentation can give rise to exponentially many topologically stable qubits protected by a single discrete symmetry. We illustrate this explicitly with the example…
Reliable quantum communication/processing links between modules are a necessary building block for various quantum processing architectures. Here we consider a spin chain system with alternating strength couplings and containing three…
We analyze the robustness of topological order in the toric code in an open boundary setting in the presence of perturbations. The boundary conditions are introduced on a cylinder, and are classified into condensing and non-condensing…
A quantum computer needs the assistance of a classical algorithm to detect and identify errors that affect encoded quantum information. At this interface of classical and quantum computing the technique of machine learning has appeared as a…
Understanding the dynamics of quantum systems is crucial in many areas of physics, but simulating many-body systems presents significant challenges due to the large Hilbert space to navigate and the exponential growth of computational…
Traditionally, quantum entanglement has played a central role in foundational discussions of quantum mechanics. The measurement of correlations between entangled particles can exhibit results at odds with classical behavior. These…
"Concurrence topology" (Ellis and Klein \emph{Homology, Homotopy, and Applications,} \textbf{16}) is a TDA method for binary data. The idea is to construct a filtration consisting of Dowker complexes then compute persistent homology.…
To achieve a fault-tolerant quantum computer, it is crucial to increase the coherence time of quantum bits. In this work, we theoretically investigate a system consisting of a series of superconducting qubits that alternate between XX and…
Characterizing complex quantum systems is a vital task in quantum information science. Quantum tomography, the standard tool used for this purpose, uses a well-designed measurement record to reconstruct quantum states and processes. It is,…
Achieving fault-tolerant quantum computation (FTQC) demands simultaneous progress in physical qubit performance and quantum error correction (QEC). This work reviews and benchmarks experimental advancements towards FTQC across leading…