output
19962026
most citedPlanck 2015 results. XIII. Cosmological parameters

10.6k citations

Showing quant-phShow all

93 papers · 1 filter

quant-ph2025★ 5 cited

Implementation of Quantum Fourier Transform and Quantum Hashing for a Quantum Device with Arbitrary Qubits Connection Graphs

Kamil Khadiev, Aliya Khadieva, Zeyu Chen +1

In the paper, we consider quantum circuits for Quantum fingerprinting (quantum hashing) and quantum Fourier transform (QFT) algorithms. Quantum fingerprinting (quantum hashing) is…

quant-ph2025★ 2 cited

Simulating methylamine using symmetry adapted qubit-excitation-based variational quantum eigensolver

Konstantin M. Makushin, Aleksey K. Fedorov

In this work, we propose and analyze optimization strategies for the VQE algorithm that combine various methods, including molecular point group symmetries (symmetry adaptation), c…

quant-ph2024★ 9 cited

Shallow Implementation of Quantum Fingerprinting with Application to Quantum Finite Automata

Mansur Ziiatdinov, Aliya Khadieva, Kamil Khadiev

Quantum fingerprinting is a technique that maps classical input word to a quantum state. The obtained quantum state is much shorter than the original word, and its processing uses…

quant-ph2024★ 3 cited

Characterization of Tunnel Diode Oscillator for Qubit Readout Applications

Ivan Grytsenko, Sander van Haagen, Oleksiy Rybalko +4

We developed a tunnel diode oscillator and characterized its performance, highlighting its potential applications in the quantum state readout of electrons in semiconductors and el…

quant-ph2024★ 9 cited

A Representative Framework for Implementing Quantum Finite Automata on Real Devices

Aliya Khadieva, Özlem Salehi, Abuzer Yakaryılmaz

We present a framework for the implementation of quantum finite automata algorithms designed for the language on gate-based quantum com…

quant-ph2024★ 1 cited

Quantum Property Testing Algorithm for the Concatenation of Two Palindromes Language

Kamil Khadiev, Danil Serov

In this paper, we present a quantum property testing algorithm for recognizing a context-free language that is a concatenation of two palindromes . The query complexity of…