Related papers: A practical, unitary simulator for non-Markovian c…
Recently a new formulation of quantum mechanics has been suggested which describes systems by means of ensembles of classical particles provided with a sign. This novel approach mainly consists of two steps: the computation of the Wigner…
Generic open quantum systems are notoriously difficult to simulate unless one looks at specific regimes. In contrast, classical dissipative systems can often be effectively described by stochastic processes, which are generally less…
In this extended abstract, we have introduced a highly memory-efficient state vector simulation of quantum circuits premised on data compression, harnessing the capabilities of both CPUs and GPUs. We have elucidated the inherent challenges…
Simulating quantum states on a classical computer is hard, typically requiring prohibitive resources in terms of memory and computational power. Efficient simulation, however, can be achieved for certain classes of quantum states, in…
Quantum computing offers promising new avenues for tackling the long-standing challenge of simulating the quantum dynamics of complex chemical systems, particularly open quantum systems coupled to external baths. However, simulating such…
Realizing the promise of quantum information processing remains a daunting task, given the omnipresence of noise and error. Adapting noise-resilient classical computing modalities to quantum mechanics may be a viable path towards near-term…
In this paper, we firstly briefly review the duality quantum computer. Distinctly, the generalized quantum gates, the basic evolution operators in a duality quantum computer are no longer unitary, and they can be expressed in terms of…
Simulating physical systems on quantum devices is one of the most promising applications of quantum technology. Current quantum approaches to simulating open quantum systems are still practically challenging on NISQ-era devices, because…
The understanding of symmetry operations has brought enormous advancements in physics, ranging from elementary particle to condensed matter systems. In quantum mechanics, symmetry operations are described by either unitary or antiunitary…
In this paper, we will introduce the quantum circuit simulator we developed in C++ environment. We devise a novel method for efficient memory handling using linked list structures that enables us to simulate a quantum circuit of up to 20…
Consumption of magic states promotes the stabilizer model of computation to universal quantum computation. Here, we propose three different classical algorithms for simulating such universal quantum circuits, and characterize them by…
Simulating quantum contextuality with classical systems requires memory. A fundamental yet open question is what is the minimum memory needed and, therefore, the precise sense in which quantum systems outperform classical ones. Here, we…
Memoryless processes are ubiquitous in nature, in contrast with the mathematics of open systems theory, which states that non-Markovian processes should be the norm. This discrepancy is usually addressed by subjectively making the…
Non-Markovian open quantum systems represent the most general dynamics when the quantum system is coupled with a bath environment. The quantum dynamics arising from many important applications are non-Markovian. Although for special cases,…
We present a quantum algorithm for simulating the dynamics of Hamiltonians that are not necessarily sparse. Our algorithm is based on the input model where the entries of the Hamiltonian are stored in a data structure in a quantum random…
Quantum simulation has become a promising avenue of research that allows one to simulate and gain insight into the models of High Energy Physics whose experimental realizations are either complicated or inaccessible with current technology.…
Parity-time ($PT$)-symmetric Hamiltonians exhibit non-unitary dynamical evolution while maintaining real spectra, and offer unique approaches to quantum sensing and entanglement generation. Here we present a method for simulating the…
Quantum algorithms profit from the interference of quantum states in an exponentially large Hilbert space and the fact that unitary transformations on that Hilbert space can be broken down to universal gates that act only on one or two…
Every year, substantial theoretical and experimental progress is made towards the realisation of a genuinely new computational paradigm in the construction of a quantum computer. But progress is fractal; to make headway is to unearth the…
Feynman, in 1982, proposed the idea of using a quantum simulator to perform quantum simulations. A quantum simulator is basically a controllable quantum system that can mimic the dynamics of other quantum systems we wish to study. In this…