<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Henri de Boutray on Medium]]></title>
        <description><![CDATA[Stories by Henri de Boutray on Medium]]></description>
        <link>https://medium.com/@henri.de.boutray?source=rss-7f869bf746d4------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*tC2qsfJq4cqddzV16006aw.jpeg</url>
            <title>Stories by Henri de Boutray on Medium</title>
            <link>https://medium.com/@henri.de.boutray?source=rss-7f869bf746d4------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Sat, 21 Nov 2026 21:53:26 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@henri.de.boutray/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Contextuality in quantum computing]]></title>
            <link>https://medium.com/colibritd-quantum/contextuality-in-quantum-computing-7815f25a1e19?source=rss-7f869bf746d4------2</link>
            <guid isPermaLink="false">https://medium.com/p/7815f25a1e19</guid>
            <category><![CDATA[contextuality]]></category>
            <category><![CDATA[quantum-computing]]></category>
            <dc:creator><![CDATA[Henri de Boutray]]></dc:creator>
            <pubDate>Mon, 09 Jan 2023 14:21:58 GMT</pubDate>
            <atom:updated>2023-01-10T15:50:21.226Z</atom:updated>
            <content:encoded><![CDATA[<p>Quantum Mechanics is known as a counter intuitive field, where things seen as impossible in our day-to-day life are perfectly normal. The two examples commonly given when mentioning this counter intuitive aspect of quantum mechanics are the superposition (the fact that Schrödinger’s cat is both dead and alive as long as its box isn’t opened [Sch35]) and entanglement (the fact that two particles can be in a state where acting on one of them would seemingly immediately have an effect of the other, such as measuring one of the qubits of the Bell state [EPR35]). Other properties, such as the destructive nature of the quantum measure (also related to Schrödinger’s cat thought experiment) can be mentioned, but today, I will present you a property that is less popular, but as disconcerting the first time you cross its path: the <em>contextuality</em>!</p><p>Contextuality is linked to another notion called locality (itself linked to entanglement) as explored in [AB11] and to hidden variable theories, but we will focus here on a fresh look on the subject by trying to start from an easy to grasp common ground, and introducing only strictly necessary notion as we go.</p><p>So! We call a situation contextual when its protagonists need a knowledge of the context in order to explain the aftermath of the situation. And we also need to restrict the ability of the protagonists to only perform <em>local</em> actions (no faster than light communication). Given this, let us examine a case where we would like to see if the situation is contextual or not.</p><figure><img alt="A medium, as dreamed by DALL·E 2" src="https://cdn-images-1.medium.com/max/1023/0*ASIu4zzQUmtVf8y8.png" /><figcaption>A fortune teller, as dreamed by DALL·E 2</figcaption></figure><p>Let us say that we are very worried about a loved one who is at the other end of the world, potentially doing dangerous activities. In order to get reassured, we go and see a fortune teller which would help us see our loved one and make sure he/she is doing OK. The fortune teller welcomes us with a cryptic sentence “Your friend is eating your lunch”. At this point, you remember that you forgot the lunch you just bought on the counter of the kitchen, with your dog (Milly). It seems like the fortune teller has a <em>non local</em> knowledge of the world: he knows something that happened at a distance and this without communication with the remote event. This said, you realize that it’s 11:30, you still have your lunch ticket peeking out of your pocket, and you have Milly’s hairs on your trousers. These three elements are part of the <em>context</em> of the current situation, and this is probably how the fortune teller guessed what happened (or rather what is happening). So in the end the experience you just lived could be explained by a contextual explanation of the event, and the fortune teller has likely no non local abilities.</p><h4>1. Formal definition</h4><p>After this wacky example of contextuality in our classical world, let’s come back on a quantum definition of it. First, some useful notions: The Pauli matrices are</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*hyAJ2TQ037oYxwy_.png" /></figure><p>and we will also use the 2 by 2 identity matrix <em>I</em> and the <em>n</em> by <em>n</em> matrix <em>Id</em>.</p><p>We consider a thought experiment where we perform operations on a <em>n</em> qubits system, and I will show you that this thought experiment exhibits a contextual behavior. The experiment is composed of several series of measurements using the operators of the Pauli group. These operators are defined as a Pauli measurement on each wire, with eventually a global phase. They are denoted by</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*y5Derx03zCgnemCk.png" /></figure><p>with <em>s</em> ∈ {±1, ±<em>i</em>} and <em>P</em>ᵢ ∈ {<em>X</em>, <em>Y</em>, <em>Z</em>, <em>I</em>}. The result of such measurements is in ±1, and the overall result of the experiment is the product of all measurement result. I will show you in Sec. <a href="#sec:link_with_finite_geometries">3</a> that we can construct such experiments where quantum theory can produce a result non reproducible by classical, non contextual theory.</p><h4>2. Link with other quantum specific properties</h4><p>What we call quantum properties are quantum specific behaviors. They can arise directly from the laws of quantum mechanics, such as the destructive nature of measurements, but they can also be “meta” properties [1], arising from the combination of several other quantum properties. Entanglement is the example of such a meta property (we couldn’t have entanglement without superposition), and contextuality is too: the way quantum measurements work is absolutely necessary for quantum contextuality (the fact that the measure projects the state on the space corresponding to the result observed is the root of the contextual behaviors).</p><p>Understanding the links between these properties may help us build an intuition concerning quantum computation. This is likely one of the reasons why they are so studied! In that regard, let us have a look at one of the papers revealing one of the deepest links in my opinion: the 2011 paper by S. Abramsky and A. Brandenburger [AB11].</p><p>In this paper, the authors show that non locality and quantum contextuality are in fact two ways to look at the same situation. And in a much deeper level, that some of the concepts having a role in those meta properties are in fact not necessarily related to quantum mechanics specifically but, in a more general way, to the mathematical specificities of the probability distribution of the associated measurement results.</p><h4>3. Link with finite geometries</h4><p>As teased in Sec. <a href="#sec:formal_definition">1</a>, this contextuality property can be exhibited using measures on a <em>n</em> qubit system. The corresponding thought experiment is decomposed as such: on this <em>n</em> qubit system, we will perform several series of measurements. If we represent each operator used for a measurement by a dot, and each series of measurement by a line, we obtain what we call a finite geometry.</p><p>This formalism can be complexified such that the finite geometry would live in a vector space, and this allows us to perform interesting operations on those geometries, but I will leave that as a teaser for an upcoming Medium article (for more information, you may read [dBHG+22]).</p><figure><img alt="The Mermin square" src="https://cdn-images-1.medium.com/max/495/0*JLD0Y6-DXm23eAJl.png" /><figcaption>The Mermin square</figcaption></figure><p>Fig. <a href="#fig:mermin-square">1</a> represent such an experiment, where the (2 qubits) operators used are the points and the series of measurement are the lines (vertical and horizontal) of this figure. Note that the last vertical line is doubled, we will see shortly why that is.</p><p>First, let us check what the result of this experiment will be. Each operator here has its eigenvalues in ±1, meaning each result of a single measurement will either be 1 or −1. In addition, each line is built such that the operators composing it commute (for two operators on a line <em>O</em>₁ and <em>O</em>₂, <em>O</em>₁<em>O</em>₂ = <em>O</em>₂<em>O</em>₁). With the rules of quantum mechanics, this results in the fact that the product of the measurements is in the spectrum (the set of all eigenvalues) of the product of the operators (if <em>r</em>ᵢ is the result of a measure by <br> <em>O</em>ᵢ, ∏ᵢ <em>r</em>ᵢ ∈ <em>sp</em>(∏ᵢ <em>O</em>ᵢ)). <br>Given that each line was also made such that the product of the operators is either <em>Id</em> or −<em>Id</em> (and that <em>sp</em>(<em>Id</em>) ={1}), the product of the measures on each line will either be 1 or −1. This is where our doubled line mentioned earlier comes into play: it is the only one where the product of the result is −1. This means that the overall product is −1 and this result cannot be reproduced by classical non contextual local theories!</p><p>The reason why this result cannot be reproduced is that such a theory can be modeled by a function that would attribute to each point a value in ±1 (the result of the “measurement”). Each point being in two lines, the product of all measurements would in this case look like <br> ∏ᵢ <em>f</em>(<em>O</em>ᵢ)×∏ᵢ <em>f</em>(<em>O</em>ᵢ) = (∏ᵢ <em>f</em>(<em>O</em>ᵢ))² = 1.<br>So in one case we obtain as a result -1 while in the other, we can’t ever obtain anything but 1.</p><p>As you may have picked up, not all experiments similar to the one shown in Fig. <a href="#fig:mermin-square">1</a> can exhibit this contextual behavior, the operators and series of measurements have to be carefully chosen.</p><h4>4. Link with quantum programs verification</h4><p>Program verification is a concept that stems as early as from the beginning of computer science. For instance, Hoare logic [Hoa69] was introduced in 1969 whereas the now very famous C language was introduced in 1972! The idea behind program verification is to <em>prove</em> that the program written by the programmer does what it was conceived to do. This proof is possible because a program is in fact nothing but a series of logical instruction, so it can be translated as a series of application of a (mathematical) function to a certain variable encoding the state of the system. The proof is then to show that the output variable validates the condition imposed by the programmer, given the input variable. Let us take a small example to explore this concept:</p><pre><em>f</em>₁(x) = x+1; <em>f</em>₂(x) = 2x<br><br>program (n) {<br>  a = <em>f</em>₁(n);<br>  b = <em>f</em>₂(a);<br>  return b;<br>}</pre><p>The program is supposed to compute 2<em>n</em>+1, the condition for the input variable (also called pre-condition) being that it’s a number, the condition for the output (also called post-condition) will be that it’s a number and that program(n) = 2n+1. Given that one can show that we should have 2<em>n</em>+1 = <em>f</em>₂(<em>a</em>) = 2<em>a</em>, and thus that 2<em>n</em>+1 = 2<em>f</em>₁(<em>n</em>) = 2(<em>n</em>+1). Since this is false, we showed that our function has a bug (without executing it)!</p><p>This is a very powerful way to verify programs, but it is pretty hard to accomplish. My previous works put the focus on trying to ease this for quantum program, by studying properties of quantum states that could be used in quantum program verification. Contextuality is one of those properties, even if (as of now) it wasn’t used in this context.</p><h4>At ColibrITD</h4><p>At <em>ColibrITD</em>, we create programs that efficiently solve our costumers’ industrial problems. Since we target industrial problems, bugs can be very costly, so having tools to automate the verification of our quantum programs is precious for us!</p><h4>References</h4><p>[AB11] Abramsky, S., and A. Brandenburger. 2011. “The Sheaf-Theoretic Structure of Non-Locality and Contextuality.” <em>New Journal of Physics</em> 13 (11): 113036. <a href="https://doi.org/10.1088/1367-2630/13/11/113036">https://doi.org/10.1088/1367-2630/13/11/113036</a>.</p><p>[dBHG+22] Boutray, H. de, F. Holweck, A. Giorgetti, P. Masson, and M. Saniga. 2022. “Contextuality Degree of Quadrics in Multi-Qubit Symplectic Polar Spaces.” <em>Journal of Physics A: Mathematical and Theoretical</em> 55 (47): 475301. <a href="https://doi.org/10.1088/1751-8121/aca36f">https://doi.org/10.1088/1751-8121/aca36f</a>.</p><p>[EPR35] Einstein, A., B. Podolsky, and N. Rosen. 1935. “Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?” <em>Physical Review</em> 47 (10): 777–80. <a href="https://doi.org/10.1103/PhysRev.47.777">https://doi.org/10.1103/PhysRev.47.777</a>.</p><p>[Hoa69] Hoare, C. A. R. 1969. “An Axiomatic Basis for Computer Programming.” <em>Communications of the ACM</em> 12 (10): 576–80. <a href="https://doi.org/10.1145/363235.363259">https://doi.org/10.1145/363235.363259</a>.</p><p>[Sch35] Schrödinger, E. 1935. “Die gegenwärtige Situation in der Quantenmechanik.” <em>Naturwissenschaften</em> 23 (48): 807–12. <a href="https://doi.org/10.1007/BF01491891">https://doi.org/10.1007/BF01491891</a>.</p><p>[1] this is not a standard name in this context</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=7815f25a1e19" width="1" height="1" alt=""><hr><p><a href="https://medium.com/colibritd-quantum/contextuality-in-quantum-computing-7815f25a1e19">Contextuality in quantum computing</a> was originally published in <a href="https://medium.com/colibritd-quantum">ColibrITD Quantum</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[(I Can’t Get No) SATisfaction]]></title>
            <link>https://medium.com/colibritd-quantum/i-cant-get-no-satisfaction-9e7e7b5b4aac?source=rss-7f869bf746d4------2</link>
            <guid isPermaLink="false">https://medium.com/p/9e7e7b5b4aac</guid>
            <category><![CDATA[quantum-computing]]></category>
            <category><![CDATA[sat]]></category>
            <dc:creator><![CDATA[Henri de Boutray]]></dc:creator>
            <pubDate>Thu, 23 Jun 2022 15:41:29 GMT</pubDate>
            <atom:updated>2022-06-27T09:12:48.420Z</atom:updated>
            <content:encoded><![CDATA[<h4>Solving problems with SAT</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*8zo5NNesIqbFYdjO2p3amQ.png" /><figcaption>Travel paths can be optimized using SAT solvers. credit <a href="https://news.delta.com/route-map-us-canada">Delta</a></figcaption></figure><p>Problem-solving is a cornerstone of our society as it allows us to create complex processes that make our lives easier. Improving those processes should probably not be an end in itself (efficiency for the beauty of efficiency), but better processes may lead to positive outcomes (efficiency for reduced energy consumption, simpler processes to understand, etc…). Amongst the problems, we are confronted with every day (conscientiously or not), discrete problems are omnipresent. The present article is on a specific class of those problems called SAT problems.</p><p>SAT or boolean SATisfiability problems are problems encoded as logic formulas. The goal is to find a value for the variables of the formula such that it evaluates to <em>True</em>. We say that those values <em>satisfy</em> the formula, and when such a set exists, the formula is <em>satisfiable</em> (it is not always the case!). Having the ability to solve SAT problems also enables the solving of many other discrete problems. When looking for a reason to want to solve SAT problems, we can first see that SAT is a very complex problem to solve (called an NP-complete problem) [Coo71], which makes it a great theoretical study subject to analyze fundamental notions concerning quantum advantage (in particular the likely differences between the P, NP and quantum equivalent classes of complexity). But they are much more than that.</p><p>Most discrete optimization problems can be encoded as SAT problems, which makes the SAT solvers extremely useful tools. Here is some examples of areas where SAT solvers are used:</p><ul><li>automated-testing (model checking), for software but not only [SBS96; BCCZ99];</li><li>automated/semi-automated theorem proving and formal software verification [DLL62; Sta94; BFMP11];</li><li>Electrical Design Automation (EDA): formal equivalence checking [PK00] or FPGA routing [NSR02];</li><li>cryptoanalysis [TID20];</li><li>various discrete optimization problems [LAK+14].</li></ul><p>These problems are usually huge in terms of the number of variables and formula size, which implies an important need for efficient solvers.</p><p>Solving more efficiently those problems using quantum computing would then enable us to use the quantum advantage for many discrete problems.</p><h4>Good candidates for quantum computing</h4><p>Many theoretical algorithms have already been exhibited (more than 400 references split into more than 60 categories of algorithms centralized in the quantum algorithm zoo [Jor21]), some of them have been run on quantum processors, but the real promise of breakthrough results thanks to quantum computing is still just that: a promise. In this context, SAT problems are especially interesting because of the huge size of the problems. Indeed, quantum computing is all about gaining a complexity advantage over classical computing: because of the nature of complexity comparison, the quantum advantage only gets bigger as the size of the systems grows. This is the reason why SAT problems are such good candidates: real-life example are typically using several thousand variables and exponentially more clauses. They are easy to check but because of the number of variables, it is extremely long to brute-force a solution.</p><p>An SAT problem is most often given as a logic formula in the Conjunctive Normal Form (CNF). A CNF is the conjunction of clauses, <em>i.e.</em> a set of clauses that must all be true conjointly (at the same time) for the whole formula to be true for some value of the variables (we say satisfiable). These clauses are themselves disjunction of literals, sets of literals that can be disjointly true for the clause to be true. Finally, each literal is either a variable or the negation of a variable. Concretely, a CNF would look like the formula below.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*7hca7hgQ35OwSnyX.png" /></figure><p>The SAT problems being in the NP-complete complexity class, are classically hard to solve. A brute-force search requires going through <em>2ⁿ</em> elements if there are <em>n</em> variables. Since there are often around <em>10³</em> variables for this kind of problem, <em>2¹⁰⁰⁰</em> solutions need to be examined. With the current rate of computing (exascale, <em>10¹⁸</em> operations per second [Hin18]), this would take around <em>10²⁷⁵</em> years. Using a quantum search algorithm may transform these questions from unthinkable to possible.</p><h4>The known, the plan, and the promising</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/470/0*Np3vgiSucGTHyl7K.png" /></figure><p>As they often are, this previous short presentation of a complex subject was a bit reductive. Indeed, as said previously, SAT solvers are used in day-to-day life, so naturally, SAT problems are solvable in less than <em>10²⁷⁵</em> years. Smarter than brute-force solutions exist, but they are not guaranteed to finish in a reasonable time so they are most often equipped with a timeout kill switch. These solvers are estimated to solve a problem in a time in <em>O(1.329…ⁿ)</em> (a short heads-up complexity theory is used a lot to evaluate quantum advantage, if you are not familiar with it, a good place to start is <a href="https://en.wikipedia.org/wiki/Computational_complexity_theory#Complexity_measures">[this]</a> section of the corresponding Wikipedia article).</p><p>In comparison, if we manage to create an oracle for this problem, we could use Grover’s algorithm [Gro96] to solve it with complexity in <em>O(√N)=O(1.41…ⁿ)</em> (the quantum circuit running the algorithm has <em>n</em> qubits and <em>N=2ⁿ</em> base states). And here is the first speed bump, as discussed in [Amb05], Grover’s algorithm alone in not sufficient to leverage a quantum advantage over the already existing algorithms that are cores to SAT solvers. This is not the end of the line though, by combining the current classical algorithms with Grover’s, we could obtain a quadratic acceleration, having complexity in <em>O(1.153…ⁿ)</em>.</p><p>This idea of using a quantum computers to solve SAT problems was already thought of by users of Qiskit, giving us the following solution present in their documentation:</p><pre>from qiskit import Aer<br>from qiskit.aqua.components.oracles import LogicalExpressionOracle<br>from qiskit.aqua.algorithms import Grover<br><br>sat_cnf = &quot;&quot;&quot;<br>c Example DIMACS 3-sat<br>p cnf 3 5<br>-1 -2 -3 0<br>1 -2 3 0<br>1 2 -3 0<br>1 -2 -3 0<br>-1 2 3 0<br>&quot;&quot;&quot;<br><br>backend = Aer.get_backend(&#39;qasm_simulator&#39;)<br>oracle = LogicalExpressionOracle(sat_cnf)<br>algorithm = Grover(oracle)<br>result = algorithm.run(backend)<br>print(result.assignment)</pre><p>Note here that the SAT problem is encoded in the <em>sat_cnf</em> variable, see their <a href="https://github.com/Qiskit/qiskit-aqua">GitHub</a> for more information. But as mentioned, even if this is interesting that this solution exists, it is not faster than classical as is.</p><p>Other leads have also been explored: by nesting quantum search, Cerf <em>et al.</em> managed to gain an exponential speedup [CGW00], and by using a very different method altogether, Bian <em>et al.</em> managed really recently to use a Quantum Annealer to explore the space of possibilities by encoding the problem as an <em>Izing model</em> characterizing the quantum annealer [BCM+20].</p><p>Finally, de Beaudrap <em>et al.</em> managed to encode SAT problems into ZH-calculus — a diagrammatic quantum language taking its roots in category theory — and use its rewrite rules to give tools to simplify SAT formulas [dKM21]. This may be an interesting lead as it means that SAT formulas may be encoded as quantum circuits, but how to use those circuits to solve the SAT problems is left to be determined.</p><p>All these options are quite promising and may enable us to solve complex problems using quantum computers. And this is where our aim at <em>ColibrITD</em> to create a platform to solve various problems unreachable for classical computers is at!</p><h4>References</h4><p><strong>[Amb05]</strong> A. Ambainis. <em>Quantum search algorithms.</em> arXiv:quant-ph/0504012, 2005.<br> <strong>[BCCZ99]</strong> A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. <em>Symbolic Model Checking without BDDs.</em> In W.R. Cleaveland, editor, Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science, pages 193–207, Berlin, Heidelberg, 1999. Springer.<br> [BCM+20] Z. Bian, F. Chudak, W. Macready, A. Roy, R. Sebastiani, and S. Varotti. <em>Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results.</em> Information and Computation, 275:104609, 2020.<br> <strong>[BFMP11]</strong> F. Bobot, J.-C. Filliâtre, C. Marché, and A. Paskevich. <em>Why3: Shepherd Your Herd of Provers.</em> In Boogie 2011: First International Workshop on Intermediate Verification Languages, page 53, 2011.<br> <strong>[CGW00]</strong> N. J. Cerf, Lov K. Grover, and Colin P. Williams. <em>Nested Quantum Search and NP-Hard Problems.</em> Applicable Algebra in Engineering, Communication and Computing, 10(4–5):311–338, 2000.<br> <strong>[Coo71]</strong> S. A. Cook. <em>The complexity of theorem-proving procedures.</em> In Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC ’71, pages 151–158, New York, NY, USA, May 1971. Association for Computing Machinery.<br> <strong>[dKM21]</strong> N. de Beaudrap, A. Kissinger, and K. Meichanetzidis. <em>Tensor Network Rewriting Strategies for Satisfiability and Counting.</em> Electronic Proceedings in Theoretical Computer Science, 340:46–59, 2021.<br> <strong>[DLL62]</strong> M. Davis, G. Logemann, and D. Loveland. <em>A machine program for theorem-proving.</em> Communica- tions of the ACM, 5(7):394–397, 1962.<br> <strong>[Gro96]</strong> L. K. Grover. <em>A Fast Quantum Mechanical Algorithm for Database Search.</em> In Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, STOC ’96, pages 212–219, New York, NY, USA, 1996. ACM.<br> <strong>[Hin18]</strong> J. Hines. <em>Genomics Code Exceeds Exaops on Summit Supercomputer</em>, 2018.<br> <strong>[Jor21]</strong> S. Jordan. Quantum Algorithm Zoo. Technical report, 2021.<br> [LAK+14] Y. Li, A. Albarghouthi, Z. Kincaid, A. Gurfinkel, and M. Chechik. <em>Symbolic optimization with SMT solvers.</em> In Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 607–618, San Diego California USA, 2014. ACM.<br> <strong>[NSR02]</strong> G.-J. Nam, K.A. Sakallah, and R.A. Rutenbar. <em>A new FPGA detailed routing approach via search-based Boolean satisfiability.</em> IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 21(6):674–684, 2002.<br> <strong>[PK00]</strong> V. Paruthi and A. Kuehlmann. <em>Equivalence checking combining a structural SAT-solver, BDDs, and simulation.</em> In Proceedings 2000 International Conference on Computer Design, pages 459–464, 2000.<br> <strong>[SBS96]</strong> P. Stephan, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. <em>Combinational test generation using satisfiability.</em> IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 15(9):1167–1176, 1996.<br> <strong>[Sta94]</strong> G. Stalmarck. <em>System for determining propositional logic theorems by applying values and rules to triplets that are generated from boolean formula</em>, 1994.<br> <strong>[TID20]</strong> M. Trimoska, S. Ionica, and G. Dequen. <em>A SAT-Based Approach for Index Calculus on Binary Elliptic Curves.</em> In Progress in Cryptology-AFRICACRYPT 2020, pages 214–235, Cairo, Egypt, 2020.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=9e7e7b5b4aac" width="1" height="1" alt=""><hr><p><a href="https://medium.com/colibritd-quantum/i-cant-get-no-satisfaction-9e7e7b5b4aac">(I Can’t Get No) SATisfaction</a> was originally published in <a href="https://medium.com/colibritd-quantum">ColibrITD Quantum</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
    </channel>
</rss>