SearcharxivSearch

arXiv subjects

Witold Jarnicki

Publications and source records attributed to Witold Jarnicki.

11 recordsLinked to original sources

CovAngelo: A hybrid quantum-classical computing platform for accurate and scalable drug discovery

We present a computational platform for modeling chemical reactions in complex molecular environments, focused on ligand-protein binding in drug discovery. The platform implements our new quantum-in-quantum-in-classical (QM/QM/MM) multiscale embedding model that integrates molecular dynamics with a quantum-information-enhanced density matrix embedding theory and quantum chemistry solvers, including explicit solvent. Quantum-information metrics are utilized to generate entanglement-consistent orbitals, enabling a high-accuracy description of strongly correlated regions. The framework supports multiple computational backends, including multi-CPU, NVIDIA multi-GPU architectures, and quantum hardware (IQM, IonQ, IBM) integrated under CUDA-Q, and is designed for compatibility with future fault-tolerant quantum systems. The new platform's capabilities are demonstrated by modeling covalent docking of zanubrutinib to Bruton's tyrosine kinase via a Michael addition mechanism, computing the full reaction energy profiles and energy barriers at a reduced computational cost relative to existing methods. As a 2nd-generation anticancer agent, zanubrutinib serves as a proof of concept for covalent inhibitor discovery. Accurate first-principles reaction barrier estimations provided by our method can contribute to reducing false positive and negative rates in drug discovery pipelines. Scalability is validated through benchmarks on GPU clusters, cloud-based CPU infrastructures. We demonstrate integration with quantum devices (up to 20 qubits), alongside resource estimates for fault-tolerant quantum computing, indicating potential speedups of up to 20x. Beyond single reactions, the platform supports the construction of reaction networks in chemical metric space, facilitating ligand screening and systematic exploration of reactive pathways.

physics.chem-ph

Diagonal operator decomposition on restricted topologies via enumeration of quantum state subsets

Various quantum algorithms require usage of arbitrary diagonal operators as subroutines. For their execution on a physical hardware, those operators must be first decomposed into target device's native gateset and its qubit connectivity for entangling gates. Here, we assume that the allowed gates are exactly the CX gate and the parameterized phase gate. We introduce a framework for the analysis of CX-only circuits and through its lens provide solution constructions for several different device topologies (fully-connected, linear and circular). We also introduce two additional variants of the problem. Those variants can be used in place of exact decomposition of the diagonal operator when the circuit following it satisfies a set of prerequisites, enabling further reduction in the CX cost of implementation. Finally, we discuss how to exploit the framework for the decomposition of a particular, rather than general, diagonal operator.

quant-ph

Introducing Structure to Expedite Quantum Search

We present a novel quantum algorithm for solving the unstructured search problem with one marked element. Our algorithm allows generating quantum circuits that use asymptotically fewer additional quantum gates than the famous Grover's algorithm and may be successfully executed on NISQ devices. We prove that our algorithm is optimal in the total number of elementary gates up to a multiplicative constant. As many NP-hard problems are not in fact unstructured, we also describe the \emph{partial uncompute} technique which exploits the oracle structure and allows a significant reduction in the number of elementary gates required to find the solution. Combining these results allows us to use asymptotically smaller number of elementary gates than the Grover's algorithm in various applications, keeping the number of queries to the oracle essentially the same. We show how the results can be applied to solve hard combinatorial problems, for example Unique k-SAT. Additionally, we show how to asymptotically reduce the number of elementary gates required to solve the unstructured search problem with multiple marked elements.

quant-ph

Efficient unstructured search implementation on current ion-trap quantum processors

So far, only the results on 3 qubit spaces (both on superconducting and ion-trap realisations of quantum processors) have beaten the classical unstructured search in the expected number of oracle calls using optimal protocols in both settings. We present experimental results on running unstructured search in spaces defined by 4, 5 and 6 qubits on ion-trapped quantum processor. Our best circuits obtained respectively 66\%, 26\% and 6\% average probability of measuring the marked element. In the case of 4 and 5 qubit spaces we obtained fewer expected number of oracle calls required to find a marked element than any classical approach. Viability of the theoretical result by Grover at these qubit counts is, to authors' knowledge demonstrated experimentally for the first time. Also at 6 qubits, a circuit using a single oracle call returned a measured probability of success exceeding any possible classical approach. These results were achieved using a variety of unstructured search algorithms in conjunction with recent developments in reducing the number of entangling gates. The latter are currently considered to be a dominating source of errors in quantum computations. Some of these improvements have been made possible by using mid-circuit measurements. To our knowledge the latter feature is currently available only on the H0 quantum processor we run on.

quant-ph

Repeatedly Appending Any Digit to Generate Composite Numbers

We investigate the problem of finding integers $k$ such that appending any number of copies of the base-ten digit $d$ to $k$ yields a composite number. In particular, we prove that there exist infinitely many integers coprime to all digits such that repeatedly appending {\it any} digit yields a composite number.

math.NT

Properties, Proved and Conjectured, of Keller, Mycielski, and Queen Graphs

We prove several results about three families of graphs. For queen graphs, defined from the usual moves of a chess queen, we find the edge-chromatic number in almost all cases. In the unproved case, we have a conjecture supported by a vast amount of computation, which involved the development of a new edge-coloring algorithm. The conjecture is that the edge-chromatic number is the maximum degree, except when simple arithmetic forces the edge-chromatic number to be one greater than the maximum degree. For Mycielski graphs, we strengthen an old result that the graphs are Hamiltonian by showing that they are Hamilton-connected (except M(3), which is a cycle). For Keller graphs G(d), we establish, in all cases, the exact value of the chromatic number, the edge-chromatic number, and the independence number, and we get the clique covering number in all cases except 5 <= d <= 7. We also investigate Hamiltonian decompositions of Keller graphs, obtaining them up to G(6).

math.CO

New effective bounds on the dimension of a linear system in $\mathbb P^2$

The main goal of this paper is to present an algorithm bounding the dimension of a linear system of curves of given degree (or monomial basis) with multiple points in general position. As a result we prove the Hirschowitz--Harbourne Conjecture when the multiplicities of base points are bounded by 11.

math.AG

Möbius function of coordinate hyperplanes in complex ellipsoids

For $p_1,...,p_n>0$, let $\mathbb E=\{z\in\mathbb C^n:\sum_{j=1}^n|z_j|^{2p_j}<1\}$ be a complex ellipsoid. We present effective formulas for the generalized Möbius and Green functions $m_{\mathbb E}(A,\cdot)$, $g_{\mathbb E}(A,\cdot)$ in the case where $A:=\{z\in\mathbb E:z_1\cdot...\cdot z_k=0\}$ ($1\leq k\leq n$).

math.CV

Kobayashi-Royden vs. Hahn pseudometric in ${\Bbb C}^2$

For a domain $D\subset{\Bbb C}$ the Kobayashi--Royden $κ$ and Hahn $h$ pseudometrics are equal iff $D$ is simply connected. Overholt showed that for $D\subset{\Bbb C}^n$, $n\geq3$, we have $h_D\equivκ_D$. Let $D_1,D_2\subset{\Bbb C}$. The aim of this paper is to show that $h_{D_1\times D_2}\equivκ_{D_1\times D_2}$ iff at least one of $D_1$, $D_2$ is simply connected or biholomorphic to ${\Bbb C}\setminus\{0\}$. In particular, there are domains $D\subset{\Bbb C}^2$ for which $h_D\not\equivκ_D$.

math.CV