Search
Search Results
-
Approximate quantum gates compilation for superconducting transmon qubits with self-navigation algorithm
Precise and fast qubit control is crucial when compiling quantum gates for successful implementation of quantum algorithms. However, the presence of...
-
Quantum circuit compilation for nearest-neighbor architecture based on reinforcement learning
To compile quantum circuits on the target processor, quantum circuits need to satisfy the nearest neighbor architecture constraint first. Therefore,...
-
Xor-And-Inverter Graphs for Quantum Compilation
Quantum compilation is the task of translating a high-level description of a quantum algorithm into a sequence of low-level quantum operations. We...
-
Near-term quantum computing techniques: Variational quantum algorithms, error mitigation, circuit compilation, benchmarking and classical simulation
Quantum computing is a game-changing technology for global academia, research centers and industries including computational science, mathematics,...
-
Approximate encoding of quantum states using shallow circuits
Quantum algorithms and simulations often require the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state,...
-
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
Faster algorithms for combinatorial optimization could prove transformative for diverse areas such as logistics, finance and machine learning....
-
Applying Machine Learning and Neural Networks to Approximate Libraries of Constants in a Few-Group Library of Neutronic Constants to Simulate RBMK-1000
AbstractThe paper describes a qualitatively new CNET library of few-group neutron cross sections designed to simulate neutronic parameters in...
-
Quantum logic gate synthesis as a Markov decision process
Reinforcement learning has witnessed recent applications to a variety of tasks in quantum programming. The underlying assumption is that those tasks...
-
From Nadyantaka to Pauṣṇa: compilation of stars catalogued in Sarvasiddhāntarāja
Sarvasiddhāntarāja (1639 CE) is an astronomical treatise composed by Nityānanda. Almost all texts on Indian astronomy provide the coordinates of 27...
-
Scalable algorithm simplification using quantum AND logic
Implementing quantum algorithms on realistic devices requires translating high-level global operations into sequences of hardware-native logic gates,...
-
JAXVacua — a framework for sampling string vacua
Moduli stabilisation in string compactifications with many light scalars remains a major blind-spot in the string landscape. In these regimes,...
-
Long-time simulations for fixed input states on quantum hardware
Publicly accessible quantum computers open the exciting possibility of experimental dynamical quantum simulations. While rapidly improving, current...
-
Framework of fractals in data analysis: theory and interpretation
This special issue is a compilation of pioneering research articles that explore the robustness of fractal theories to address and analyse the...
-
Quantum compiling by deep reinforcement learning
The general problem of quantum compiling is to approximate any unitary transformation that describes the quantum computation as a sequence of...
-
The Euclidean Adler function and its interplay with \( \Delta {\alpha}_{\textrm{QED}}^{\textrm{had}} \) and αs
Three different approaches to precisely describe the Adler function in the Euclidean regime at around 2 GeVs are available: dispersion relations...
-
Efficient algorithm for full-state quantum circuit simulation with DD compression while maintaining accuracy
With the development of noisy intermediate-scale quantum machines, quantum processors show their supremacy in specific applications. To better...
-
-
Adjustable-depth quantum circuit for position-dependent coin operators of discrete-time quantum walks
Discrete-time quantum walks with position-dependent coin operators have numerous applications. For a position dependence that is sufficiently smooth,...
-
A meta-trained generator for quantum architecture search
Variational Quantum Algorithms (VQAs) have made great success in the Noisy Intermediate-Scale Quantum (NISQ) era due to their relative resilience to...
-
Probabilistic state synthesis based on optimal convex approximation
When preparing a pure state with a quantum circuit, there is an unavoidable approximation error due to the compilation error in fault-tolerant...
