Related papers: Shallow-Depth Variational Quantum Hypothesis Testi…
The single-photon quantum filtering problems have been investigated recently with applications in quantum computing. In practice, the detector responds with a quantum efficiency of less than unity since there exists some mode mismatch…
The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this algorithm depends crucially on the ability to…
In order to enable the sequential implementation of quantum information theoretic protocols in the continuous variable framework, we propose two schemes for resource reusability, resource-splitting protocol and unsharp homodyne…
Variational quantum machine learning algorithms have been proposed as promising tools for time series prediction, with the potential to handle complex sequential data more effectively than classical approaches. However, their practical…
Distinguishing physical processes is one of the fundamental problems in quantum physics. Although distinguishability of quantum preparations and quantum channels have been studied considerably, distinguishability of quantum measurements…
Solving non-Hermitian quantum many-body systems on a quantum computer by minimizing the variational energy is challenging as the energy can be complex. Here, based on energy variance, we propose a variational method for solving the…
In a Bayesian analysis, the likelihood that specific candidate parameters govern the evolution of a quantum system are conditioned on the outcome of measurements which, in turn, cause measurement backaction on the state of the system [M.…
Quantum state filtering is a variant of the unambiguous state discrimination problem: the states are grouped in sets and we want to determine to which particular set a given input state belongs.The simplest case, when the N given states are…
This paper presents studies on a deterministic annealing algorithm based on quantum annealing for variational Bayes (QAVB) inference, which can be seen as an extension of the simulated annealing for variational Bayes (SAVB) inference. QAVB…
This paper presents studies on a deterministic annealing algorithm based on quantum annealing for variational Bayes (QAVB) inference, which can be seen as an extension of the simulated annealing for variational Bayes (SAVB) inference. QAVB…
We theoretically and experimentally investigate conditional enhancement of overall coherence of quantum states by probabilistic quantum operations that apply to the input state a quantum filter diagonal in the basis of incoherent states. We…
Quantum error correction is crucial for protecting quantum information against decoherence. Traditional codes like the surface code require substantial overhead, making them impractical for near-term, early fault-tolerant devices. We…
We present a hybrid quantum-classical variational scheme to enhance precision in quantum metrology. In the scheme, both the initial state and the measurement basis in the quantum part are parameterized and optimized via the classical part.…
Simulating large quantum systems is the ultimate goal of quantum computing. Variational quantum simulation (VQS) gives us a tool to achieve the goal in near-term devices by distributing the computation load to both classical and quantum…
Hybrid quantum-classical embedding methods for correlated materials simulations provide a path towards potential quantum advantage. However, the required quantum resources arising from the multi-band nature of $d$ and $f$ electron materials…
We develop a device-independent framework for testing quantum channels. That is, we falsify a hypothesis about a quantum channel based only on an observed set of input-output correlations. Formally, the problem consists of characterizing…
Algorithmic discrepancy theory seeks efficient algorithms to find those two-colorings of a set that minimize a given measure of coloring imbalance in the set, its {\it discrepancy}. The {\it Euclidean discrepancy} problem and the problem of…
The quantum approximate optimisation algorithm was proposed as a heuristic method for solving combinatorial optimisation problems on near-term quantum computers and may be among the first algorithms to perform useful computations in the…
We aim to devise feasible, efficient verification schemes for bosonic channels. To this end, we construct an average-fidelity witness that yields a tight lower bound for average fidelity plus a general framework for verifying optimal…
This paper presents a hybrid variational quantum algorithm that finds a random eigenvector of a unitary matrix with a known quantum circuit. The algorithm is based on the SWAP test on trial states generated by a parametrized quantum…