Related papers: Schrodinger cat animated on a quantum computer
Quantum computing may speed up numerical problems involving large matrices that are demanding for classical computers, and active research on this possibility is ongoing. In this work, we propose quantum algorithms for the exact simulation…
We consider experimentally feasible chains of trapped ions with pseudo-spin 1/2, and find models that can potentially be used to implement error-resistant quantum computation. Similar in spirit to classical neural networks, the…
To achieve universal quantum computation via general fault-tolerant schemes, stabilizer operations must be supplemented with other non-stabilizer quantum resources. Motivated by this necessity, we develop a resource theory for magic quantum…
Near-term quantum devices generally suffer from shallow circuit depth and hence limited expressivity due to noise and decoherence. To address this, we propose tensor-network-assisted parametrized quantum circuits, which concatenate a…
Making use of an universal quantum network or QCPU proposed by me [6], some special quantum networks for simulating some quantum systems are given out. Specially, it is obtained that the quantum network for the time evolution operator which…
We introduce a Schr\"odinger chiral cat qubit, a novel bosonic quantum code generalizing Kerr cat qubits that exploits higher-order nonlinearities. Compared to a standard Kerr cat, the chiral cat qubit allows additional correction of…
Simulating quantum algorithms with classical resources generally requires exponential resources. However, heuristic classical approaches are often very efficient in approximately simulating special circuit structures, for example with…
Quantum superpositions of distinct coherent states in a single-mode harmonic oscillator, known as "cat states", have been an elegant demonstration of Schrodinger's famous cat paradox. Here, we realize a two-mode cat state of electromagnetic…
Verification of NISQ era quantum devices demands fast classical simulation of large noisy quantum circuits. We present an algorithm based on the stabilizer formalism that can efficiently simulate noisy stabilizer circuits. Additionally, the…
Classical simulation of noisy quantum circuits is essential for understanding quantum computing experiments. It enables scalable error characterization, analysis of how noise impacts quantum algorithms, and optimized implementations of…
Quantum simulation represents the most promising quantum application to demonstrate quantum advantage on near-term noisy intermediate-scale quantum (NISQ) computers, yet available quantum simulation algorithms are prone to errors and thus…
Simulations in high-energy physics are currently emerging as an application of noisy intermediate-scale quantum (NISQ) computers. In this work, we explore the multi-flavor lattice Schwinger model - a toy model inspired by quantum…
Today's experimental noisy quantum processors can compete with and surpass all known algorithms on state-of-the-art supercomputers for the computational benchmark task of Random Circuit Sampling [1-5]. Additionally, a circuit-based quantum…
Today, the competition to build a quantum computer continues, and the number of qubits in hardware is increasing rapidly. However, the quantum noise that comes with this process reduces the performance of algorithmic applications, so…
We propose a fast scheme to generate Schr\"odinger cat states in a superconducting resonator using a continuously driven qubit without resorting to the dispersive regime, two-photon drives, or engineered two-photon dissipation. We provide…
We construct a classical algorithm that designs quantum circuits for algorithmic quantum simulation of arbitrary qudit channels on fault-tolerant quantum computers within a pre-specified error tolerance with respect to diamond-norm…
We define formally decohered quantum computers (using density matrices), and present a simulation of them by a probabalistic classical Turing Machine. We study the slowdown of the simulation for two cases: (1) sequential quantum computers,…
The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations. In this era of noisy intermediate-scale quantum (NISQ) computing, systematic…
In addition to being a very interesting quantum phenomenon, Schr\"odinger cat swapping has the potential for application in the preparation of quantum states that could be used in metrology and other quantum processing. We study in detail…
Shadow tomography is a scalable technique to characterise the quantum state of a quantum computer or quantum simulator. The protocol is based on the transformation of the outcomes of random measurements into the so-called classical shadows,…