Zobrazeno 1 - 10
of 8 952
pro vyhledávání: '"Classical Simulation"'
Autor:
Ahmad, Wira Azmoon, Sutcliffe, Matthew
It is known that a quantum circuit may be simulated with classical hardware via stabilizer state (T-)decomposition in $O(2^{\alpha t})$ time, given $t$ non-Clifford gates and a decomposition efficiency $\alpha$. The past years have seen a number of p
Externí odkaz:
http://arxiv.org/abs/2412.17182
Autor:
Lerch, Sacha, Puig, Ricard, Rudolph, Manuel S., Angrisani, Armando, Jones, Tyson, Cerezo, M., Thanasilp, Supanut, Holmes, Zoë
Understanding the capabilities of classical simulation methods is key to identifying where quantum computers are advantageous. Not only does this ensure that quantum computers are used only where necessary, but also one can potentially identify subro
Externí odkaz:
http://arxiv.org/abs/2411.19896
Autor:
Lyu, Xingjian, Bu, Kaifeng
This work explores displaced fermionic Gaussian operators with nonzero linear terms. We first demonstrate equivalence between several characterizations of displaced Gaussian states. We also provide an efficient classical simulation protocol for displ
Externí odkaz:
http://arxiv.org/abs/2411.18517
A path for efficient classical simulation of the DQC1 circuit that estimates the trace of an implementable unitary under the zero discord condition [Phys. Rev. Lett. 105, 190502 (2010)] is presented. This result reinforces the status of non-classical
Externí odkaz:
http://arxiv.org/abs/2411.18348
Classically simulating circuits with bosonic codes is a challenging task due to the prohibitive cost of simulating quantum systems with many, possibly infinite, energy levels. We propose an algorithm to simulate circuits with encoded Gottesman-Kitaev
Externí odkaz:
http://arxiv.org/abs/2412.13136
We construct a polynomial-time classical algorithm that samples from the output distribution of low-depth noisy Clifford circuits with any product-state inputs and final single-qubit measurements in any basis. This class of circuits includes Clifford
Externí odkaz:
http://arxiv.org/abs/2411.02535
Classical and quantum states can be distinguished by entanglement entropy, which can be viewed as a measure of quantum resources. Entanglement entropy also plays a pivotal role in understanding computational complexity in simulating quantum systems.
Externí odkaz:
http://arxiv.org/abs/2409.16895
We introduce a new classical simulation algorithm based on non-signaling polytopes of multipartite Bell scenarios, capable of simulating universal measurement-based quantum computation with single-qubit Pauli measurements. In our model, the simultane
Externí odkaz:
http://arxiv.org/abs/2410.23734
Implementations of Roetteler's shifted bent function algorithm have in recent years been used to test and benchmark both classical simulation algorithms and quantum hardware. These circuits have many favorable properties, including a tunable amount o
Externí odkaz:
http://arxiv.org/abs/2408.02778
Autor:
Velmurugan, Haemanth, Das, Arnav, Chatterjee, Turbasu, Saha, Amit, Chattopadhyay, Anupam, Chakrabarti, Amlan
Simulating quantum circuits is a computationally intensive task that relies heavily on tensor products and matrix multiplications, which can be inefficient. Recent advancements, eliminate the need for tensor products and matrix multiplications, offer
Externí odkaz:
http://arxiv.org/abs/2410.17876