Related papers: Color it, Code it, Cancel it: k-local dynamical de…
Dynamical decoupling is the leading technique to remove unwanted interactions in a vast range of quantum systems through fast rotations. But what determines the time-scale of such rotations in order to achieve good decoupling? By providing…
Dynamic quantum circuits integrate mid-circuit measurements and feed-forward operations to enable real-time classical processing and conditional quantum logic. These capabilities are central to key quantum protocols such as quantum error…
Simulating the dynamics of large quantum systems is a formidable yet vital pursuit for obtaining a deeper understanding of quantum mechanical phenomena. While quantum computers hold great promise for speeding up such simulations, their…
We study the problem of counting $k$-hypergraphlets, an interesting but surprisingly ignored primitive, with the aim of understanding whether efficient algorithms exist. To this end, we consider color coding, a well-known technique for…
Current quantum computing devices have different strengths and weaknesses depending on their architectures. This means that flexible approaches to circuit design are necessary. We address this task by introducing a novel space-efficient…
A range of quantum algorithms, especially those leveraging variational parameterization and circuit-based optimization, are being studied as alternatives for solving classically intractable combinatorial optimization problems (COPs).…
Decorated cospans provide a categorical framework for composing open systems along shared interfaces. This paper is a computational proof of concept: we show that the framework produces a working coupled dynamical system when the…
Maintaining a dynamic $k$-core decomposition is an important problem that identifies dense subgraphs in dynamically changing graphs. Recent work by Liu et al. [SPAA 2022] presents a parallel batch-dynamic algorithm for maintaining an…
We investigate the performance of dynamical decoupling methods at suppressing electron spin decoherence from a low-temperature nuclear spin reservoir in a quantum dot. The controlled dynamics is studied through exact numerical simulation,…
A new dynamical cascade code for decaying hot nuclei is proposed and specially adapted to the synthesis of super-heavy nuclei. For such a case, the interesting channel is the tiny fraction that will decay through particles emission, thus…
In this work, two experimentally feasible methods of decoherence engineering-one based on the application of stochastic classical kicks and the other based on temporally randomized pulse sequences are combined. A different coupling…
While it seems possible that quantum computers may allow for algorithms offering a computational speed-up over classical algorithms for some problems, the issue is poorly understood. We explore this computational speed-up by investigating…
Recently, the makespan-minimization problem of compiling a general class of quantum algorithms into near-term quantum processors has been introduced to the AI community. The research demonstrated that temporal planning is a strong approach…
Dynamical decoupling (DD) is a key technique for suppressing decoherence and preserving the performance of quantum algorithms. We introduce a measurement-based DD (MDD) protocol that determines control unitary gates from partial…
The loss of quantum information due to interaction with external degrees of freedom, which is known as decoherence, remains one of the main obstacles for large-scale implementations of quantum computing. Accordingly, different measures are…
Recent results on supercomputers show that beyond 65K cores, the efficiency of molecular dynamics simulations of interfacial systems decreases significantly. In this paper, we introduce a dynamic cutoff method (DCM) for interfacial systems…
Decoherence is a major obstacle to any practical implementation of quantum information processing. One of the leading strategies to reduce decoherence is dynamical decoupling --- the use of an external field to average out the effect of the…
To reduce circuit depth when executing Quantum algorithms, it is necessary to maximize qubit connectivity on a near-term quantum processor. While addressing this, we also need to ensure high gate fidelity, suppression of unwanted ZZ…
Distributed quantum computing (DQC) provides a promising route toward scalable quantum computation, where entanglement-assisted LOCC and circuit knitting represent two complementary approaches. The former deterministically realizes nonlocal…
Deviations from classical physics when distant quantum systems become correlated are interesting both fundamentally and operationally. There exist situations where the correlations enable collaborative tasks that are impossible within the…