Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Tracing Quantum State Distinguishers via Backtracking

Mark Zhandry

Published Jan 1, 2023• 4 citations
Publisher
DOI
10.1007/978-3-031-38554-4_1

Related papers

Practical Implementation of a Quantum Backtracking Algorithm

Simon Martiel, Maxime Remaud

arXiv:1908.11291•Lecture notes in computer science•Jan 1, 2020•8 citations

Backtracking method applicable to optical quantum calculation

Kimihiro Saito

Optical quantum devices are promoting the development not only of communication but also of quantum computation using optical quantum gates. Here, we will explain how to replace circuits consisting of gates such as NOT, AND, etc. used in classical logic calculations with quantum calculation gates. These classical gates can be expressed as NOT and CNOT of quantum computing gates. We show how to express these quantum gates as optical devices using the behavior of the polarization of discrete photons. Next, we describe the backtracking method of quantum circuits utilizing the reversibility of quantum gates. Since classical gates are not unitary, we use probabilistic methods that rely on measurements. In a typical classical gate, there are multiple inputs corresponding to a certain output, so backtracking requires tracing multiple states. The quantum bit representation, which can represent superposition states, is suitable for this purpose. As an application example, we explain how to backtrack integer multipliers and perform factorization. In configuration using quantum gates, one measurement quantum bit is required for each element, resulting in a large number of state bits. However, by reusing bits that are no longer needed, it was possible to construct a circuit with a number of state bits proportional to the number of bits for the integer multiplicand. We simulated an integer multiplier circuit by combining classical gates, and backtrack the circuit to derive two factors from a composite number represented by quantum bits. We performed simulations on a PC and succeeded in factorizing a 100-bit composite number.

Industrial Optical Devices and Systems (ODS)•Oct 4, 2024•1 citation

Backtracking method applicable to optical quantum calculation and integer factorization

Kimihiro Saito

Optical quantum devices are promoting the development not only of communication but also of quantum computation using optical quantum gates. We will explain how to replace circuits consisting of gates such as NOT and AND used in classical logic calculations with quantum calculation gates. These classical gates can be expressed as NOT and CNOT of quantum computing gates. We show how to express these quantum gates as optical devices using the behavior of the polarization of discrete photons. Next, we describe the backtracking method of quantum circuits utilizing the reversibility of quantum gates. As classical gates are not unitary, we use probabilistic methods that rely on measurements. In a typical classical gate, there are multiple inputs corresponding to a certain output, so backtracking requires tracing multiple states. The quantum bit representation, which can represent superposition states, is suitable for this purpose. As an application example, we explain how to backtrack integer multipliers and perform factorization. In a configuration using quantum gates, one measurement quantum bit is required for each element, resulting in a large number of state bits. However, by reusing bits that are no longer needed, it was possible to construct a circuit with a number of state bits proportional to the number of bits for the integer multiplicand. We simulated an integer multiplier circuit by combining classical gates and backtracked the circuit to derive two factors from a composite number represented by quantum bits. By performing a simulation on a PC, we succeeded in factorizing a 100-bit composite number, subject to the condition that it is a product of two prime numbers close to less than 2m1−1 and 2m2−1, where m1 and m2 are integers. We compare our method with the calculation using satisfiability (SAT) for the factoring problem.

Optical Engineering•Apr 14, 2025•1 citation

Learning quantum states from their classical shadows

Hsin-Yuan Huang

Nature Reviews Physics•Jan 10, 2022•45 citations

Distinguishing pure and thermal states by Landauer’s principle in open systems

Hao Xu

Abstract Starting from Polchinski’s thought experiment on how to distinguish between pure and thermal states, we construct a specific system to study the interaction between qubit and cavity quantum field theory (QFT) in order to provide a more operational point of view. Without imposing any restrictions on the initial states of qubit and cavity QFT, we compute the evolution of the system order by order by the perturbation method. We choose Landauer’s principle, an important bound in quantum computation and quantum measurement, as the basis for the determination of the thermal state. By backtracking the initial state form, we obtain the conditions that must be satisfied by the cavity QFT: the expectation value of the annihilation operator should be zero, and the expectation value of the particle number operator should satisfy the Bose–Einstein distribution. We also discuss the difference between the thermal state and a possible alternative to the thermal state: the canonical thermal pure quantum (CTPQ) state.

arXiv:2402.04628•The European Physical Journal C•Apr 4, 2024•3 citations

Quantum algorithms for state reconstruction

Eric Pedrol Ripoll

•Sep 9, 2013•0 citations
Optical quantum devices are promoting the development not only of communication but also of quantum computation using optical quantum gates. Here, we will explain how to replace circuits consisting of gates such as NOT, AND, etc. used in classical logic calculations with quantum calculation gates. These classical gates can be expressed as NOT and CNOT of quantum computing gates. We show how to express these quantum gates as optical devices using the behavior of the polarization of discrete photons. Next, we describe the backtracking method of quantum circuits utilizing the reversibility of quantum gates. Since classical gates are not unitary, we use probabilistic methods that rely on measurements. In a typical classical gate, there are multiple inputs corresponding to a certain output, so backtracking requires tracing multiple states. The quantum bit representation, which can represent superposition states, is suitable for this purpose. As an application example, we explain how to backtrack integer multipliers and perform factorization. In configuration using quantum gates, one measurement quantum bit is required for each element, resulting in a large number of state bits. However, by reusing bits that are no longer needed, it was possible to construct a circuit with a number of state bits proportional to the number of bits for the integer multiplicand. We simulated an integer multiplier circuit by combining classical gates, and backtrack the circuit to derive two factors from a composite number represented by quantum bits. We performed simulations on a PC and succeeded in factorizing a 100-bit composite number.
Optical quantum devices are promoting the development not only of communication but also of quantum computation using optical quantum gates. We will explain how to replace circuits consisting of gates such as NOT and AND used in classical logic calculations with quantum calculation gates. These classical gates can be expressed as NOT and CNOT of quantum computing gates. We show how to express these quantum gates as optical devices using the behavior of the polarization of discrete photons. Next, we describe the backtracking method of quantum circuits utilizing the reversibility of quantum gates. As classical gates are not unitary, we use probabilistic methods that rely on measurements. In a typical classical gate, there are multiple inputs corresponding to a certain output, so backtracking requires tracing multiple states. The quantum bit representation, which can represent superposition states, is suitable for this purpose. As an application example, we explain how to backtrack integer multipliers and perform factorization. In a configuration using quantum gates, one measurement quantum bit is required for each element, resulting in a large number of state bits. However, by reusing bits that are no longer needed, it was possible to construct a circuit with a number of state bits proportional to the number of bits for the integer multiplicand. We simulated an integer multiplier circuit by combining classical gates and backtracked the circuit to derive two factors from a composite number represented by quantum bits. By performing a simulation on a PC, we succeeded in factorizing a 100-bit composite number, subject to the condition that it is a product of two prime numbers close to less than 2m1−1 and 2m2−1, where m1 and m2 are integers. We compare our method with the calculation using satisfiability (SAT) for the factoring problem.
Abstract Starting from Polchinski’s thought experiment on how to distinguish between pure and thermal states, we construct a specific system to study the interaction between qubit and cavity quantum field theory (QFT) in order to provide a more operational point of view. Without imposing any restrictions on the initial states of qubit and cavity QFT, we compute the evolution of the system order by order by the perturbation method. We choose Landauer’s principle, an important bound in quantum computation and quantum measurement, as the basis for the determination of the thermal state. By backtracking the initial state form, we obtain the conditions that must be satisfied by the cavity QFT: the expectation value of the annihilation operator should be zero, and the expectation value of the particle number operator should satisfy the Bose–Einstein distribution. We also discuss the difference between the thermal state and a possible alternative to the thermal state: the canonical thermal pure quantum (CTPQ) state.