Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Formal Charges

Formal Charges

In some cases, there are seemingly more than one valid Lewis structures for molecules and polyatomic ions. The concept of formal charges can be used to help predict the most appropriate Lewis structure when more than one reasonable structure exists.

Constraints and Statical Determinacy

Constraints and Statical Determinacy

In structural engineering, the equilibrium of a system is not only determined by its equations of equilibrium but also with the help of constraints. Constraints refer to restrictions on the motion of a system. The proper combinations of constraints can minimize the total number of constraints needed to maintain a system in mechanical equilibrium. When this happens, the system is said to be statically determinate. For such systems, the unknown reaction supports can be estimated using equilibrium...

Stability of Equilibrium Configuration: Problem Solving

Stability of Equilibrium Configuration: Problem Solving

The stability of equilibrium configurations is an important concept in physics, engineering, and other related fields. In simple terms, it refers to the tendency of an object or system to return to its equilibrium position after being disturbed. The stability of an equilibrium configuration can be analyzed by considering the potential energy function of the system and examining its behavior near the equilibrium point.
Problem-solving in the context of the stability of equilibrium configuration...

Synthetic Disvision of Polynomials

Synthetic Disvision of Polynomials

Synthetic division is an efficient algorithmic approach for dividing a polynomial by a linear binomial of the form x - c, where c is a real number. This method is helpful due to its streamlined process, which avoids the more cumbersome steps involved in the traditional long division of polynomials. It simplifies computation and serves as a practical tool for evaluating polynomials and identifying their factors.To perform synthetic division, one begins by listing the coefficients of the...

Castigliano's Theorem: Problem Solving

Castigliano's Theorem: Problem Solving

The deflection of a simply supported beam that carries a central point load can be analyzed using structural mechanics principles, particularly by applying Castigliano's theorem. This theorem relates the displacement at the load application point to the partial derivatives of the strain energy in the structure. The simply supported beam with a point load at its center has symmetric reaction forces at the supports, each bearing half of the load. The bending moment at any point along the beam is...

Alternative Sets of Equilibrium Equations

Alternative Sets of Equilibrium Equations

When analyzing the behavior of structures, engineers often rely on the concept of equilibrium. This refers to the state where all forces and moments acting on a system balance each other, resulting in no net movement or rotation. In many cases, equilibrium can be described by a set of standard equations. However, in some situations, alternative sets of equilibrium equations must be used to describe the system's behavior accurately.
One example of such a situation can be observed in a...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Artificial intelligence for quantum computing.

Nature communications·2025

Same author

Real-Time Multi-Ion-Monitoring Front-End With Interference Compensation by Multi-Output Support Vector Regressor.

IEEE transactions on biomedical circuits and systems·2021

Same author

Continuous monitoring of propofol in human serum with fouling compensation by support vector classifier.

Biosensors & bioelectronics·2020

Same author

Synthesizing adaptive test strategies from temporal logic specifications.

Formal methods in system design·2019

Same author

Fast Procedures for the Electrodeposition of Platinum Nanostructures on Miniaturized Electrodes for Improved Ion Sensing.

Sensors (Basel, Switzerland)·2019

Same author

A novel electrochemical sensor for non-invasive monitoring of lithium levels in mood disorders.

Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference·2018

Search research articles

Related Experiment Video

Updated: Jan 1, 2026

Scalable Quantum Integrated Circuits on Superconducting Two-Dimensional Electron Gas Platform

Scalable Quantum Integrated Circuits on Superconducting Two-Dimensional Electron Gas Platform

Published on: August 2, 2019

Boolean satisfiability in quantum compilation.

Mathias Soeken¹, Giulia Meuli¹, Bruno Schmitt¹

¹EPFL, Lausanne, Switzerland.

Philosophical Transactions. Series A, Mathematical, Physical, and Engineering Sciences

|December 24, 2019

Summary

Quantum compilation translates quantum algorithms into computer instructions. This study proposes Boolean satisfiability algorithms to solve complex, NP-hard tasks within the quantum compilation flow.

Keywords:

Boolean satisfiability logic synthesis quantum compilation quantum computing quantum programming languages

More Related Videos

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

Related Experiment Videos

Last Updated: Jan 1, 2026

Scalable Quantum Integrated Circuits on Superconducting Two-Dimensional Electron Gas Platform

Scalable Quantum Integrated Circuits on Superconducting Two-Dimensional Electron Gas Platform

Published on: August 2, 2019

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

Area of Science:

Quantum computing
Computer science
Algorithm design

Background:

Quantum compilation bridges high-level quantum algorithms and low-level physical quantum computer instructions.
The compilation process involves multiple abstraction layers, with many tasks being computationally complex (NP-hard).

Purpose of the Study:

To describe the multi-stage quantum compilation flow.
To propose novel algorithms for optimizing quantum compilation tasks.

Main Methods:

Utilizing Boolean satisfiability (SAT) solvers to address NP-hard problems in quantum compilation.
Describing the layered abstraction flow of quantum compilation.

Main Results:

Algorithms based on Boolean satisfiability are presented as a viable approach for computationally complex quantum compilation tasks.
The study outlines a structured quantum compilation flow.

Conclusions:

Boolean satisfiability offers a promising framework for tackling challenging problems in quantum compilation.
The proposed methods aim to improve the efficiency and feasibility of translating quantum algorithms for physical hardware.