Related papers: Genetically Engineered Quantum Circuits for Financ…
Hybrid variational quantum algorithms (VQAs) are promising for solving practical problems such as combinatorial optimization, quantum chemistry simulation, quantum machine learning, and quantum error correction on noisy quantum computers.…
We present a swift walk-through of our recent work that uses machine learning to fit interatomic potentials based on quantum mechanical data. We describe our Gaussian Approximation Potentials (GAP) framework, discussing a variety of…
We propose the variational quantum singular value decomposition based on encoding the elements of the considered { $N\times N$} matrix into the state of a quantum system of appropriate dimension. This method doesn't use the expansion of…
Gaussian stochastic process (GaSP) has been widely used as a prior over functions due to its flexibility and tractability in modeling. However, the computational cost in evaluating the likelihood is $O(n^3)$, where $n$ is the number of…
To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from…
Discrete stochastic processes (DSP) are instrumental for modelling the dynamics of probabilistic systems and have a wide spectrum of applications in science and engineering. DSPs are usually analyzed via Monte Carlo methods since the number…
A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from…
In the field of fault-tolerant quantum computing, continuous-variable systems can be utilized to protect quantum information from noise through the use of bosonic codes. These codes map qubit-type quantum information onto the larger bosonic…
Signal processing (SP) techniques convert DNA and protein sequences into information that lead to successful drug discovery. One must, however, be aware about the difference between information and entropy1. Eight other physical properties…
Practical quantum computing requires robust encoding of logical qubits in physical systems to protect fragile quantum information. Currently, the lack of scalability limits the logical encoding in most physical systems, and thus the high…
We propose a general framework for decoding quantum error-correcting codes with generative modeling. The model utilizes autoregressive neural networks, specifically Transformers, to learn the joint probability of logical operators and…
We introduce a quantum algorithm to compute the market risk of financial derivatives. Previous work has shown that quantum amplitude estimation can accelerate derivative pricing quadratically in the target error and we extend this to a…
Quantum computing holds transformative potential for medical applications, yet efficiently preparing quantum states from complex medical data remains a fundamental challenge. This survey provides a comprehensive examination of current…
The aim of this paper is to develop novel quantum algorithms for Gaussian process quadrature methods. Gaussian process quadratures are numerical integration methods where Gaussian processes are used as functional priors for the integrands…
We introduce an efficient algorithm for the systematic design of shallow-depth quantum circuits capable of preparing many-body quantum states represented as Matrix Product States (MPS). The proposed method leverages Schmidt spectrum…
Efficient sampling from a classical Gibbs distribution is an important computational problem with applications ranging from statistical physics over Monte Carlo and optimization algorithms to machine learning. We introduce a family of…
The amplitude encoding of an arbitrary $n$-qubit state vector requires $\Omega(2^n)$ gate operations, owing to the exponential dimension of the Hilbert space. We can, however, form dimensionality-reduced representations of quantum states…
Variational quantum algorithms have been acknowledged as a leading strategy to realize near-term quantum advantages in meaningful tasks, including machine learning and combinatorial optimization. When applied to tasks involving classical…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
Effective quantum computation relies upon making good use of the exponential information capacity of a quantum machine. A large barrier to designing quantum algorithms for execution on real quantum machines is that, in general, it is…