相关论文: Gate-Level Simulation of Quantum Circuits

Probabilistic graphical models such as Bayesian networks are widely used to model stochastic systems to perform various types of analysis such as probabilistic prediction, risk analysis, and system health monitoring, which can become…

The Gottesman-Knill theorem asserts that quantum circuits composed solely of Clifford gates can be efficiently simulated classically. This theorem hinges on the fact that Clifford gates map Pauli strings to other Pauli strings, thereby…

Arrays of optically trapped atoms excited to Rydberg states have recently emerged as a competitive physical platform for quantum simulation and computing, where high-fidelity state preparation and readout, quantum logic gates and controlled…

Designing quantum processors is a complex task that demands advanced verification methods to ensure their correct functionality. However, traditional methods of comprehensively verifying quantum devices, such as quantum process tomography,…

Quantum circuit simulation is crucial for the development of quantum algorithms, particularly given the high cost and noise limitations of physical quantum hardware. While full-state quantum circuit simulation is commonly employed for…

We propose a simpler and more efficient scheme for the implementation of the multi-valued Grover's quantum search. The multi-valued search generalizes the original Grover's search by replacing qubits with qudits --- quantum systems of $d$…

Simulating quantum physics with a device which itself is quantum mechanical, a notion Richard Feynman originated, would be an unparallelled computational resource. However, the universal quantum simulation of fermionic systems is daunting…

High-connectivity circuits are a major roadblock for current quantum hardware. We propose a hybrid classical-quantum algorithm to simulate such circuits without swap-gate ladders. As main technical tool, we introduce…

The use of $d$-level qudits instead of two-level qubits can largely increase the power of quantum logic for many applications, ranging from quantum simulations to quantum error correction. Molecular Nanomagnets are ideal spin systems to…

Advances in quantum technologies are often limited by slow device characterization, complex tuning requirements, and scalability challenges. Spin qubits in electrostatically defined quantum dots provide a promising platform but are not…

Quantum computing is an emerging technology, promising a paradigm shift in computing, and allowing for speedups in many different problems. However, quantum devices are still in their early stages, most with only a small number qubits. This…

Demonstration of quantum advantage remains challenging due to the increased overhead of controlling large quantum systems. While significant effort has been devoted to qubit-based devices, qudits ($d$-level systems) offer potential…

With quantum computers promising advantages even in the near-term NISQ era, there is a lively community that develops software and toolkits for the design of corresponding quantum circuits. Although the underlying problems are different,…

Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random…

Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimisation, eigenvalue estimation and machine learning. Here we establish the quantum computational universality of variational quantum computation by…

Quantum computers can efficiently simulate Lindbladian dynamics, enabling powerful applications in open system simulation, thermal and ground-state preparation, autonomous quantum error correction, dissipative engineering, and more. Despite…

Classical simulations of quantum circuits are limited in both space and time when the qubit count is above 50, the realm where quantum supremacy reigns. However, recently, for the low depth circuit with more than 50 qubits, there are…

Hardware-efficient circuits employed in Quantum Machine Learning are typically composed of alternating layers of uniformly applied gates. High-speed numerical simulators for such circuits are crucial for advancing research in this field. In…

Simulating quantum circuits on classical computers is a notoriously hard, yet increasingly important task for the development and testing of quantum algorithms. In order to alleviate this inherent complexity, efficient data structures and…

We present a novel benchmark application of a quantum algorithm to Feynman loop integrals. The two on-shell states of a Feynman propagator are identified with the two states of a qubit and a quantum algorithm is used to unfold the causal…