activity
20192024
most citedQuASeR -- Quantum Accelerated De Novo DNA Sequence Reconstruction

65 citations · 192 across the 18 of their papers we have counts for

collaborators

18 papers

quant-ph2024

A resource-efficient variational quantum algorithm for mRNA codon optimization

Hongfeng Zhang, Aritra Sarkar, Koen Bertels

Optimizing the mRNA codon has an essential impact on gene expression for a specific target protein. It is an NP-hard problem; thus, exact solutions to such optimization problems be…

quant-ph2024★ 5 cited

Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity

Matthew Steinberg, Medina Bandic, Sacha Szkudlarek +3

Efficiently mapping quantum circuits onto hardware is an integral part of the quantum compilation process, wherein a circuit is modified in accordance with the stringent architectu…

quant-ph2023

Visualizing Quantum Circuit Probability -- estimating computational action for quantum program synthesis

Bao Gia Bach, Akash Kundu, Tamal Acharya +1

This research applies concepts from algorithmic probability to Boolean and quantum combinatorial logic circuits. A tutorial-style introduction to states and various notions of the…

quant-ph2022★ 5 cited

Automated Quantum Software Engineering: why? what? how?

Aritra Sarkar

This article provides a personal perspective on research in Automated Quantum Software Engineering (AQSE). It elucidates the motivation to research AQSE (why?), a precise descripti…

quant-ph2022

A scalable quantum gate-based implementation for causal hypothesis testing

Akash Kundu, Tamal Acharya, Aritra Sarkar

In this work, we study quantum computing algorithms for accelerating causal inference. Specifically, we consider the formalism of causal hypothesis testing presented in [\textit{Na…

quant-ph2022★ 3 cited

Efficient parameterised compilation for hybrid quantum programming

A. M. Krol, K. Mesman, A. Sarkar +2

Near term quantum devices have the potential to outperform classical computing through the use of hybrid classical-quantum algorithms such as Variational Quantum Eigensolvers. Thes…

quant-ph2021★ 1 cited

QKSA: Quantum Knowledge Seeking Agent -- resource-optimized reinforcement learning using quantum process tomography

Aritra Sarkar, Zaid Al-Ars, Harshitta Gandhi +1

In this research, we extend the universal reinforcement learning (URL) agent models of artificial general intelligence to quantum environments. The utility function of a classical…

quant-ph2021

QKSA: Quantum Knowledge Seeking Agent

Aritra Sarkar

In this article we present the motivation and the core thesis towards the implementation of a Quantum Knowledge Seeking Agent (QKSA). QKSA is a general reinforcement learning agent…

quant-ph2021

Quantum Computing -- A new scientific revolution in the making

Koen Bertels, Emma Turki, Tamara Sarac +2

Given the impending timeline of developing good-quality quantum processing units, it is time to rethink the approach to advance quantum computing research. Rather than waiting for…

quant-ph2021★ 6 cited

Quantum Accelerator Stack: A Research Roadmap

K. Bertels, A. Sarkar, A. Krol +7

This paper presents the definition and implementation of a quantum computer architecture to enable creating a new computational device - a quantum computer as an accelerator In thi…

quant-ph2021★ 47 cited

Efficient decomposition of unitary matrices in quantum circuit compilers

A. M. Krol, A. Sarkar, I. Ashraf +2

Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation…

cs.LO2020

The computational inevitability of life: self-replication under resource-bounded nested algorithmic probability

Aritra Sarkar

Recent computational experiments have demonstrated the spontaneous emergence of self-replicating programs across universal automata, artificial chemistries, and self-modifying code…

quant-ph2020

ACSS-q: Algorithmic complexity for short strings via quantum accelerated approach

Aritra Sarkar, Koen Bertels

In this research we present a quantum circuit for estimating algorithmic complexity using the coding theorem method. This accelerates inferring algorithmic structure in data for di…

quant-ph2020

Quantum circuit design for universal distribution using a superposition of classical automata

Aritra Sarkar, Zaid Al-Ars, Koen Bertels

In this research, we present a quantum circuit design and implementation for a parallel universal linear bounded automata. This circuit is able to accelerate the inference of algor…

quant-ph2020★ 65 cited

QuASeR -- Quantum Accelerated De Novo DNA Sequence Reconstruction

Aritra Sarkar, Zaid Al-Ars, Koen Bertels

In this article, we present QuASeR, a reference-free DNA sequence reconstruction implementation via de novo assembly on both gate-based and quantum annealing platforms. Each one of…

quant-ph2020

Integration and Evaluation of Quantum Accelerators for Data-Driven User Functions

Thomas Hubregtsen, Christoph Segler, Josef Pichlmeier +3

Quantum computers hold great promise for accelerating computationally challenging algorithms on noisy intermediate-scale quantum (NISQ) devices in the upcoming years. Much attentio…

quant-ph2019★ 16 cited

An algorithm for DNA read alignment on quantum accelerators

Aritra Sarkar, Zaid Al-Ars, Carmen G. Almudever +1

With small-scale quantum processors transitioning from experimental physics labs to industrial products, these processors allow us to efficiently compute important algorithms in va…

quant-ph2019★ 44 cited

Quantum Computer Architecture: Towards Full-Stack Quantum Accelerators

K. Bertels, A. Sarkar, A. A. Mouedenne +4

This paper presents the definition and implementation of a quantum computer architecture to enable creating a new computational device - a quantum computer as an accelerator. In th…