Related papers: Sparse Phase Ansatzes for Resource-Efficient Qudit…
Efficient encoding of classical information plays a fundamental role in numerous practical quantum algorithms. However, the preparation of an arbitrary amplitude-encoded state has been proven to be time-consuming, and its deployment on…
Quantum secure communication provides a new way for protecting the security of information. As an important component of quantum secure communication, remote state preparation (RSP) can securely transmit a quantum state from a sender to a…
Generation and preservation of quantum entanglement are among the primary tasks in quantum information processing. State stabilization via quantum bath engineering offers a resource-efficient approach to achieve this objective. However,…
An energy gap develops near quantum critical point of quantum phase transition in a finite many-body (MB) system, facilitating the ground state transformation by adiabatic parameter change. In real application scenarios, however, the…
Quantum machine learning is considered one of the flagship applications of quantum computers, where variational quantum circuits could be the leading paradigm both in the near-term quantum devices and the early fault-tolerant quantum…
Quantum error correction is essential for reliable quantum computation, where surface codes demonstrate high fault-tolerant thresholds and hardware efficiency. However, noise in single-shot measurements limits logical readout fidelity,…
Generative quantum machine learning has gained significant attention for its ability to produce quantum states with desired distributions. Among various quantum generative models, quantum denoising diffusion probabilistic models (QuDDPMs)…
We present a scheme for the dissipative preparation of an entangled steady state of two superconducting qubits in a circuit QED setup. Combining resonator photon loss, a dissipative process already present in the setup, with an effective…
Low-bit deep neural networks (DNNs) become critical for embedded applications due to their low storage requirement and computing efficiency. However, they suffer much from the non-negligible accuracy drop. This paper proposes the stochastic…
Realizing practical quantum computing requires overcoming a number of computation errors and the limitation of device size, which have intensively been tackled by quantum error mitigation (QEM) these days. As a unified approach of…
Quantum fidelity estimation is essential for benchmarking quantum states and processes on noisy quantum devices. While stabilizer operations form the foundation of fault-tolerant quantum computing, non-stabilizer resources further enable…
Entanglement distribution is a crucial problem in quantum information science, owing to the essential role that entanglement plays in enabling advanced quantum protocols, including quantum teleportation and quantum cryptography. We…
We propose a general scheme for dissipatively preparing arbitrary pure quantum states on a multipartite qubit register in a finite number of basic control blocks. Our "splitting-subspace" approach relies on control resources that are…
We describe and demonstrate a method for the computation of quantum dynamics on small, noisy universal quantum computers. This method relies on the idea of `restarting' the dynamics; at least one approximate time step is taken on the…
Quantum Computing allows, in principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register, offering a promising solution to overcome the limitations of traditional quantum chemistry…
In this paper, we propose a protocol to prepare W states with superconducting quantum interference devices (SQUID) by using dressed states. Through choosing a set of dressed states suitably, the protocol can be used to accelerate the…
We present a new technique for efficiently transitioning a quantum system from an initial to a final stationary state in less time than is required by an adiabatic (quasi-static) process. Our approach makes use of Nelson's stochastic…
The deterministic preparation of quantum many-body ground states is essential for advanced quantum simulation, yet optimal algorithms often require prohibitive hardware resources. Here, we propose a highly efficient, non-variational…
Limited by fixed step-size and sparsity penalty factor, the conventional sparsity-aware normalized subband adaptive filtering (NSAF) type algorithms suffer from trade-off requirements of high filtering accurateness and quicker convergence…
Instantaneous Quantum Polynomial-time (IQP) circuits are a candidate for demonstrating near-term quantum advantage, as their sampling task is believed to be classically hard in the ideal theoretical setting under standard…