Related papers: The Power of Noisy Fermionic Quantum Computation
We review existing classical simulation methods for performing fermionic Gaussian operations and develop new methods to address the gap by adhering to the fundamental theoretical framework established by Bravyi [Quantum Info. Comput. 5, 216…
The mixture of Gaussian distributions, a soft version of k-means , is considered a state-of-the-art clustering algorithm. It is widely used in computer vision for selecting classes, e.g., color, texture, and shapes. In this algorithm, each…
Quantum simulation is a central application of near-term quantum devices, pursued in both analog and digital architectures. A key challenge for both paradigms is the effect of imperfections and noise on predictive power. In this work, we…
Noninteracting bosons were proposed to be used for a demonstration of quantum-computing supremacy in a boson-sampling setup. A similar demonstration with fermions would require that the fermions are initially prepared in an entangled state.…
The simulation of entangled ground-states of quantum materials remains challenging for classical computational methods in more than one spatial dimension, and is a prime target for quantum computational advantage. To this end, an important…
Fault-tolerant quantum computations require alternating quantum and classical computations, where the classical computations prove vital in detecting and correcting errors in the quantum computation. Recently, interest in using these…
Schemes for topological quantum computation are usually based on the assumption that the system is initially prepared in a specific state. In practice, this state preparation is expected to be challenging as it involves non-topological…
Classically hard to simulate quantum states, or "magic states", are prerequisites to quantum advantage, highlighting an apparent separation between classically and quantumly tractable problems. Classically simulable states such as Clifford…
This paper proves the threshold result, which asserts that quantum computation can be made robust against errors and inaccuracies, when the error rate, $\eta$, is smaller than a constant threshold, $\eta_c$. The result holds for a very…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…
Quantum kernel methods have been widely recognized as one of promising quantum machine learning algorithms that have potential to achieve quantum advantages. In this paper, we theoretically characterize the power of noisy quantum kernels…
We propose a procedure for the robust preparation of maximally entangled states of identical fermionic qubits, studying the role played by particle statistics in the process. The protocol exploits externally activated noisy channels to…
Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures…
Non-Markovian noise, arising from environmental memory effects, is the most general and challenging form of noise in quantum computing, and is typically difficult to characterize and suppress. Here, we analyze and experimentally demonstrate…
To realize the full potential of quantum computers, we must mitigate qubit errors by developing noise-aware algorithms, compilers, and architectures. Thus, simulating quantum programs on high-performance computing (HPC) systems with…
We introduce a genetic algorithm that designs quantum optics experiments for engineering quantum states with specific properties. Our algorithm is powerful and flexible, and can easily be modified to find methods of engineering states for a…
The cluster state model for quantum computation [Phys. Rev. Lett. 86, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum…
Although the emergence of a fully-functional quantum computer may still be far away from today, in the near future, it is possible to have medium-size, special-purpose, quantum devices that can perform computational tasks not efficiently…
It is known that if the quantum gates in a proposed quantum computer are so noisy that they are incapable of generating entanglement, then the device can be efficiently simulated classically. If the measurements and single particle…
Quantum supremacy poses that a realistic quantum computer can perform a calculation that classical computers cannot in any reasonable amount of time. It has become a topic of significant research interest since the birth of the field, and…