<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="3.10.0">Jekyll</generator><link href="https://vveiln.github.io/feed.xml" rel="self" type="application/atom+xml" /><link href="https://vveiln.github.io/" rel="alternate" type="text/html" /><updated>2026-11-01T18:58:14+00:00</updated><id>https://vveiln.github.io/feed.xml</id><title type="html">vveiln ✨</title><subtitle>It is Yulia here. I write about whatever stuff I find interesting.</subtitle><author><name>Yulia Khalniyazova</name></author><entry><title type="html">Quantum Computing Pt. I: quantum cheat sheet</title><link href="https://vveiln.github.io/2026/07/24/qc1.html" rel="alternate" type="text/html" title="Quantum Computing Pt. I: quantum cheat sheet" /><published>2026-07-24T00:00:00+00:00</published><updated>2026-07-24T00:00:00+00:00</updated><id>https://vveiln.github.io/2026/07/24/qc1</id><content type="html" xml:base="https://vveiln.github.io/2026/07/24/qc1.html"><![CDATA[<aside>I wrote a series of quantum computing posts as an attempt to structure my understanding of it as I learn. I'm not a quantum computing expert, the explanations are simplified and may contain mistakes.</aside>

<p>In order to effectively discuss quantum computers, here is a quantum cheat sheet that explains most main concepts.</p>
<h2 id="a-quantum-system">A quantum system</h2>

<p>Imagine we received a package with a quantum system inside. We unpack it. We don’t yet understand what it is, but we got it in our hands. We can study it. What we, curious minds, want to do, is to describe it.</p>

<p>First, we notice that it consists of individual units called <strong>qudits</strong> (yes, quDits). Qudits have states that we can measure. After playing with a bunch of qudits for some time we infer that:</p>
<ul>
  <li>a qudit measurement can only give <code class="language-plaintext highlighter-rouge">n</code> possible values</li>
  <li>measuring seemingly identical qudits at the same time may give different results:
    <ul>
      <li>at certain times, we get the same state from many qudits - they all behave the same way</li>
      <li>at other times, the measurement outcome seems completely random</li>
    </ul>
  </li>
</ul>

<p>After measuring qudits many times, we get some data that contains:</p>
<ul>
  <li>time of the measurement</li>
  <li>qudit id (we enumerated them)</li>
  <li>measurement outcome</li>
</ul>

<p>For any given moment in time, we can compute the probability of getting a certain measurement outcome.</p>

<p>We keep playing with qudits, keep deriving some rules. Eventually we notice that qudits described like that behave following the rules of vector algebra in an <code class="language-plaintext highlighter-rouge">n</code>-dimensional Hilbert space. We are very good with math, apparently.</p>

<p>We also notice that the math itself doesn’t change for different <code class="language-plaintext highlighter-rouge">n</code>, only the numbers. If <code class="language-plaintext highlighter-rouge">n = 2</code>, we call qudits <strong>qubits</strong>. That is what we use to build quantum computers.</p>
<h3 id="qubits">Qubits</h3>

<p>A <strong>qubit</strong> is a quantum bit. When measured, it can be found in one of two possible states: <strong>ground</strong> (zero) or <strong>excited</strong> (one).</p>

<p>When we prepare the system, we put the qubits in the <strong>init state</strong>. Usually it is the ground state. Then we perform some computations using qubits and then we <strong>measure</strong> and then determine what it means. Until we measure, we don’t exactly know the qubit’s state, it is like tasting food we are cooking: you never know if it is gonna be too much or too little salt. In classical systems, you can measure anything at all times. The soup stays too salty no matter how many times you try it, damn it. In a quantum system, measuring gives you the value of the measured qubit and also messes everything up. So we got to be careful.</p>

<p>How do measurement outcomes relate to the state before measurement?</p>

<p>The way it works is that at any given time, if we measure a qubit, we will get either ground or excited state. But the act of measurement kinda <em>creates</em> this state. And before we measure, something very non-classical is happening.</p>

<h4 id="wave-function">Wave function</h4>

<p>Imagine that on the shoulders of the qubit, there is an angel and a demon. The angel thinks that the ground, relaxed state is better. The demon thinks that agitated, excited state is better. And they are actually fighting to prove a point. At any moment, one of them is winning. If one of them wins, then all measurements will always give us the state the winner was fighting for. But if we measure before the fight is over, the measurement outcome is unknown, but we know that the closer to winning a fighter is, the more likely we measure their preferred state.</p>

<p>Now, the fight is actually..staged. The angel and demon just move following the script they wrote together. The script is called a <strong>wave function</strong>.</p>

<p><img src="/assets/images/qc1-wave-function-fight.png" alt="Wave function fight" /></p>

<h4 id="decoherence">Decoherence</h4>

<p>Anyway, qubits are not actually qubits at all times. When we put a qubit in the init state, it is quantum and everything is good. But from that moment on, a classical timer starts ticking. Interaction with the environment makes qubits slowly turn into a non-quantum pumpkin that has no quantum properties.</p>

<p>After that, we need to make it quantum again until it once again turns into a pumpkin. The amount of time it takes a fresh qubit to turn into a pumpkin is called <strong>decoherence time</strong>.</p>

<p>We care about decoherence time because it breaks everything. Imagine running some program. You have some internal state, but this state slowly changes into something random?? This is not a way to perform reliable computations. So we need to make sure that whatever operations we perform on qubits, they are much faster than decoherence time. That will allow us to run a chunk of computation and get the results before it is pumpkin time.</p>

<h4 id="quantum-computing">Quantum computing</h4>

<p>The operations we perform on qubits we do with the help of <strong>quantum gates</strong>. It is the same idea as in classical computers: we have a fixed set of tiny circuits that we use as building blocks for big diverse circuits.</p>

<p>To summarize, <strong>quantum computers</strong> allow us performing computations. We represent the desired computations as <strong>quantum circuits</strong>, which consist of <strong>quantum gates</strong>. We <strong>init</strong> the qubits and perform operations on qubits using <strong>quantum gates</strong> before <strong>decoherence</strong> causes decay of the state, and <strong>measure</strong> the state of some qubits at the end to get the result.</p>]]></content><author><name>Yulia Khalniyazova</name></author><summary type="html"><![CDATA[In order to effectively discuss quantum computers, here is a quantum cheat sheet that explains most main concepts.]]></summary></entry><entry><title type="html">Quantum Computing Pt. II: classical vs quantum</title><link href="https://vveiln.github.io/2026/07/24/qc2.html" rel="alternate" type="text/html" title="Quantum Computing Pt. II: classical vs quantum" /><published>2026-07-24T00:00:00+00:00</published><updated>2026-07-24T00:00:00+00:00</updated><id>https://vveiln.github.io/2026/07/24/qc2</id><content type="html" xml:base="https://vveiln.github.io/2026/07/24/qc2.html"><![CDATA[<aside>I wrote a series of quantum computing posts as an attempt to structure my understanding of it as I learn. I'm not a quantum computing expert, the explanations are simplified and may contain mistakes.</aside>

<h2 id="what-is-a-bit">What is a bit?</h2>

<p>A <strong>bit</strong>, or a classical bit, is a unit of information. We can think of bits as a yes/no answer to some question. We can combine these simple answers to answer more complex questions or infer answers to simpler questions from the answers to more complex ones. This will be <strong>boolean logic</strong>, which is a subfield of discrete math.</p>

<p><strong>Boolean</strong> <strong>gates</strong> are little devices that perform boolean operations. Arranging boolean gates together results in all kinds of <strong>boolean circuits</strong> and enables classical computing.</p>

<h3 id="lets-get-physical">Let’s get physical</h3>

<p>How do we turn this abstraction into something real? What is happening inside computers?Which part of the abstraction do we implement?</p>

<p>We implement boolean gates - they are the building blocks of the circuits.</p>

<p>Boolean gates are made of <strong>transistors</strong> connected to each other in a specific way. There are multiple kinds of transistors but they all work similarly. A transistor is a piece of silicon that is split into layers. Different layers are infused with different atoms, kinda like vanilla and chocolate ice cream layered next to each other. Layering silicon infused with different kinds of atoms enables the physical functions of a transistor. Here is how it works: it is connected to a power source and also has an input and output, three “legs” in total (think of a three-legged silicon spider). If the signal on the input is high enough, the power is flowing through the output <sup id="fnref:2" role="doc-noteref"><a href="#fn:2" class="footnote" rel="footnote">1</a></sup>.</p>

<p>Connecting transistors in different ways implements different boolean logics and different gates. Bits  themselves here are represented by the signal on the wires, high or low voltage level.</p>

<p><img src="/assets/images/qc2-nand.png" alt="(N)AND gate formed by connecting two transistors" /></p>

<table>
  <thead>
    <tr>
      <th>Abstraction</th>
      <th>Physical</th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td>bit</td>
      <td>voltage level</td>
    </tr>
    <tr>
      <td>no or yes</td>
      <td>low voltage or high voltage</td>
    </tr>
    <tr>
      <td>boolean gates</td>
      <td>transistors connected in a specific way</td>
    </tr>
    <tr>
      <td>boolean circuit</td>
      <td>gates connected in a specific way</td>
    </tr>
  </tbody>
</table>

<p>Note that this representation applies to computation. For storage, bits are represented differently.</p>

<h2 id="what-is-a-qubit">What is a qubit?</h2>

<p>A qubit - a quantum bit - is also a unit of information. Measuring a bit can only give one or zero, measuring a qubit can only result in excited or ground state.</p>

<p>A system of bits is modeled as a boolean space with boolean logic rules. A system of qubits is mathematically modeled as a Hilbert space with linear algebra rules.</p>

<p>Instead of boolean gates we have quantum gates, instead of classical circuits we have quantum circuits, and instead of classical computing we have quantum computing.</p>

<p>Instead of classical physics rules, physical qubits follow the rules of quantum mechanics.</p>

<h3 id="lets-get-physical-but-make-it-quantum">Let’s get physical, but make it quantum</h3>

<p>Classical gates are implemented with transistors. For quantum gates, there are multiple options: trapped ions, superconducting circuits, photons, etc. There are so many options for a quantum computer because a proper quantum computer doesn’t really exist yet and there is no clear winner. Before we started using transistors for classical computers, other technologies for implementing classical gates were used too.</p>

<table>
  <thead>
    <tr>
      <th>Classical bit</th>
      <th>Quantum bit</th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td>0 or 1</td>
      <td>ground or excited</td>
    </tr>
    <tr>
      <td>boolean logic</td>
      <td>linear algebra</td>
    </tr>
    <tr>
      <td>boolean gates</td>
      <td>quantum gates</td>
    </tr>
    <tr>
      <td>classical computing</td>
      <td>quantum computing</td>
    </tr>
    <tr>
      <td>classical physics</td>
      <td>quantum mechanics</td>
    </tr>
    <tr>
      <td>transistors</td>
      <td>superconductors/ions/photons/etc</td>
    </tr>
  </tbody>
</table>

<h3 id="the-difference">The difference</h3>

<p>So far, we see a clear analogy, but if it was just that, there would be no need in quantum computers. What is the difference?</p>

<h3 id="superposition">Superposition</h3>

<p>Let’s look into a quantum system and follow what is happening to a qubit’s state. We can split the state lifecycle into parts each of which has two phases:</p>
<ol>
  <li>pre-measurement</li>
  <li>measurement</li>
</ol>

<p>Measurement in a quantum system doesn’t just show the existing value we didn’t see before, it <em>creates</em> a value. It <em>has</em> to create a value, because there simply <em>was no value</em> before. The qubit was in a <strong>superposition state</strong>.</p>

<p>Superposition state is not a classical state. It can never be a measurement outcome, it only exists in pre-measurement world.</p>

<p>People often say that superposition state is when the qubit is in both states at once - superposition. I find this interpretation confusing. I like to think of the superposition state as a space of opportunities for the future measured state outcome.</p>

<p><img src="/assets/images/qc2-measurement.png" alt="Qubit before and after measurement" /></p>

<p>Mathematically, a measurement outcome is a <strong>basis</strong> state (eigenvector of the measurement operator) - either ground or excited. The superposition state is described as a sum of the two basis states and coefficients standing before them. The coefficients are also not constant, they form a wave function that has different values at different times (angels and demons fighting, remember?). They also can be used to compute the probabilities of getting basis states if we were to measure the qubit in that moment.</p>

<p>Anyway, this property of a qubit - being in a superposition state - is something that makes quantum computing interesting for us.</p>
<h3 id="entanglement">Entanglement</h3>

<p>Entanglement is another property of a quantum system that we are interested in. It is pretty easy to explain: two qubits are related in a way that when we measure one, we learn the value of the other automatically, no matter how far they are physically.</p>

<p>Mathematically it means that we cannot describe the state of one qubit without involving the state of the other qubit. It is like there is a term of the form <code class="language-plaintext highlighter-rouge">xy</code> in the equation (where <code class="language-plaintext highlighter-rouge">x</code> is a part of the state of one qubit and <code class="language-plaintext highlighter-rouge">y</code> is a part of the state of the other qubit).</p>

<h3 id="conclusion">Conclusion</h3>

<p>Quantum computers are modelled after classical computers. We use binary values as the units of information and gates as building blocks. The differences between classical and quantum phenomenons - superposition and entanglement among them - is what makes quantum computers offer unique properties.</p>
<div class="footnotes" role="doc-endnotes">
  <ol>
    <li id="fn:2" role="doc-endnote">
      <p>or the other way around <a href="#fnref:2" class="reversefootnote" role="doc-backlink">&#8617;</a></p>
    </li>
  </ol>
</div>]]></content><author><name>Yulia Khalniyazova</name></author><summary type="html"><![CDATA[Let's see how quantum computers are similar to and different from the classical ones.]]></summary></entry><entry><title type="html">Quantum Computing Pt. III: how to build a quantum computer</title><link href="https://vveiln.github.io/2026/07/24/qc3.html" rel="alternate" type="text/html" title="Quantum Computing Pt. III: how to build a quantum computer" /><published>2026-07-24T00:00:00+00:00</published><updated>2026-07-24T00:00:00+00:00</updated><id>https://vveiln.github.io/2026/07/24/qc3</id><content type="html" xml:base="https://vveiln.github.io/2026/07/24/qc3.html"><![CDATA[<aside>I wrote a series of quantum computing posts as an attempt to structure my understanding of it as I learn. I'm not a quantum computing expert, the explanations are simplified and may contain mistakes.</aside>

<p>Creating a working scallable architecture for a quantum computer is a work in progress and there are multiple approaches being explored. In this post I try to describe the structure of quantum computers more generally and explore two approaches for building quantum computers.</p>

<h3 id="the-structure">The structure</h3>

<p>I identified three functional components that make a quantum computer:</p>
<ul>
  <li><strong>quantum core</strong> - responsible for the quantum magic</li>
  <li><strong>reinforcement layer</strong> - makes the core stable and reliable</li>
  <li><strong>classical cortex</strong> - that is how we ask the quantum wizzard to do us a quantum favour - provides input and interprets the output</li>
</ul>

<p>The boundaries might be a bit fuzzy in practice, but I find this structure helpful for easier understanding of the system.</p>

<h4 id="quantum-core">Quantum core</h4>

<p><strong>Quantum core</strong> is the defining component of the architecture as it dictates what the reinforcement layer and classical cortex work with and constraints the ways they can work together.</p>

<p>“Figuring out” the quantum core of the quantum computer involves the following aspects:</p>
<ul>
  <li>phyiscal:
    <ul>
      <li><strong>qubit implementation</strong> - this is the defining aspect of the defining component - quantum core -  so it is suuuuper defining. Basically it is about the physical system that will be called a qubit in our computer. Naturally, we are picking from the systems that do have quantum properties, such as trapped ions, superconducting circuits, etc. The choice of the qubit implementation tells us how to perform the measurement, what kind of isolation it requires and what should be optimized for.</li>
      <li><strong>qubit manipulation</strong> - it is about how to poke a qubit when you want it to do something. These “something” can be measurement, putting it in the init state, etc.</li>
      <li><strong>qubit connection</strong> - how we connect the qubits together to enable multi-qubit computations without too much noise ruining everything</li>
    </ul>
  </li>
  <li>algorithmic:
    <ul>
      <li><strong>measurement</strong> and <strong>initialization</strong> - are the abstract algorithms that use qubit manipulation to measure the qubit state or to put it in a defined state</li>
    </ul>
  </li>
</ul>

<p>A list of criteria that defines what makes a proper quantum core is called <strong>DiVincenzo criteria</strong>. Here is my free interpretation of the list:</p>
<ul>
  <li>clear qubit definition</li>
  <li>scalability without a significant loss of quantum properties</li>
  <li>ability to initialize the state</li>
  <li>ability to measure</li>
  <li>long enough coherence times</li>
  <li>a defined set of quantum gates that allows building any circuit</li>
</ul>

<p>There are also two criteria for quantum communication specifically, but I’ll skip those here.</p>

<h4 id="reinforcement-layer">Reinforcement layer</h4>

<p>The <strong>reinforcement</strong> layer is all about making the system stable:</p>
<ul>
  <li><strong>physical isolation</strong> - how to keep qubits noise free, increase the duration of the coherence period, keep qubits from affecting each other unintentionally, etc</li>
  <li><strong>error correction</strong> - given that the quantum system is fragile and expensive, we would like to increase the fidelity of the system</li>
</ul>

<h4 id="classical-cortex">Classical cortex</h4>

<p>The <strong>classical cortex</strong> aspects include:</p>
<ul>
  <li><strong>control system</strong> that we use to direct the computer into doing what we want. It includes the electronic part - how do we literally connect classical and non-classical pieces together</li>
  <li><strong>interpretation software</strong> - we need a system that translates our lowly questions into something the quantum sage can understand and then translate the wise quantum words back</li>
</ul>

<h2 id="exploring-the-real-architectures">Exploring the real architectures</h2>

<p>Now let’s take a look at two approaches for building quantum computers. We will consider it from the perspective of the suuuuperdefining component - qubit implementation.</p>

<h3 id="architecture-ii-trapped-ions">Architecture II: Trapped ions</h3>

<p>Ions are atoms that lost some electrons. We know that atoms are neutral: the nucleus is positively charged, and electrons balance it out by their negative charge. Removing some electrons leaves a positively charged <strong>ion</strong>.</p>

<p>Because ions are charged, we can use electric field to control the position of an ion so that it doesn’t fly away. That is why this approach is called <strong>trapped</strong>.</p>

<h4 id="encoding-qubits-and-states">Encoding qubits and states</h4>

<p>One ion corresponds to one qubit. The excited and ground state of a qubit are encoded by an electron either being on a lower or higher energy level. Think of it as of a set of stairs - the higher up you are, the more energy you have. Electrons prefer to be on a lower step of the stairs.</p>

<p>We can manipulate such qubits by shooting some energy at them (using photons) and push them to a higher energy level. They eventually fall back to the lower level and release the energy back - decoherence.</p>

<p><img src="/assets/images/qc3-ions.png" alt="Manipulating a trapped ion qubit" /></p>

<h4 id="measurement">Measurement</h4>

<p>A qubit in any state can absorb or emit energy. When it absorbs energy, its electron jumps up the stairs. When it emits energy, the electron jumps down the stairs. It takes different amount of energy to jump between different steps, and the qubit will only absorb the exact amount of energy that it can use to jump somewhere (no energy leftovers).</p>

<p>This is the phenomenon we are basing the measurement strategy on:</p>
<ol>
  <li>shoot the amount of energy it takes to jump from ground to excited state</li>
  <li>if the energy is absorbed, the qubit was in the ground state</li>
  <li>if it is sent back, it is in the excited state (assuming the system is coherent)</li>
</ol>

<h4 id="reinforcement">Reinforcement</h4>

<p>Trapped-ion-based qubits are small and the more we have, the bigger the negative effects are. We need to keep them cool to have less noise and make the little devils move slower. The more qubits we have, the more different frequencies we need, and, well, eventually it becomes hard to maintain. Photons we use for qubit manipulation can escape, meaning we might miss the cue and they can disturb the system.</p>

<h4 id="fun-facts">Fun facts</h4>

<p>Commonly used ions include barium, calcium, beryllium, strontium, and ytterbium. Ytterbium has higher coherehce times, and barium can be manipulated with photons from the visible spectrum.</p>

<h3 id="architecture-ii-superconducting-circuits">Architecture II: Superconducting circuits</h3>

<p>First things first: what is a superconductor?</p>

<p>Imagine an atom. It has electrons that are stuck to the atom and tearing them off takes some energy. The less energy it takes to take them off, the more conducting the material is. Naturally, there are isolators (very hard to tear off), semiconductors (somewhat hard to tear off), conductors (quite easy). Unnaturally - in very low temperatures - some materials have infinite conductivity. These are called <strong>superconductors</strong>.</p>

<p>All kinds of materials (compound and pure) can act as superconductors, but for quantum computers most common choices are metals like aluminum and niobium.</p>

<p>Now, what is a circuit? Just a regular classical circuit like in regular classical computers, but with wires made of superconductors. Well, of course we can’t use just any circuit, but the word circuit here means that.</p>

<p>Superconducting circuits seem like the most unusual qubit implementation to me because compared to other choices (ions, photons, etc) they are GIGANTIC. And because most (all?) other implementations are particles, people look at the superconducting circuits in a similar way - sometimes they are called artificial atoms.</p>

<h4 id="encoding">Encoding</h4>

<p>The superconducting circuit that corresponds to a single qubit is called a <strong>transmon</strong>. Such circuits contain capacitors and inductors - elements that don’t produce almost any heat - and an element called <strong>Josephson junction</strong> that makes the energy levels uneven, so we can define the ground and excited states like in atoms.</p>

<p>Such qubits are manipulated using light as well. Transmons require way lower frequencies compared to ions, so we use microwave generators instead of lasers (that we use for ions) to do that.</p>
<h4 id="measurement-1">Measurement</h4>

<p>We use <strong>resonators</strong> to detect changes in the system. A resonator is a device that responds only to specific frequencies of the light. The <strong>resonant frequency</strong> - the frequency a resonator responds to - changes slightly depending on what state the qubit is in (the qubit and resonator are physically connected), so we can measure the qubit state by measuring the resonator state.</p>

<p><img src="/assets/images/qc3-superconducting.png" alt="Superconducting qubit system" /></p>

<h4 id="reinforcement-1">Reinforcement</h4>

<p>First, we need really low temperatures for our system to work, and unlike other systems, it isn’t just to make it more stable and less noisy. Superconductivity only happens at low temperatures, so we need it to have any quantum properties at all.</p>

<p>Similarly to the trapped ion situation, the more qubits we connect, the harder it is to control the system, and after a certain limit everything is fucked up completely. Puffff.</p>

<p>Also, because these qubits are GIGANTIC, the decoherence times are LOW, so..we gotta be fast.</p>

<p>And we also need to protect the system from the noise like always.</p>]]></content><author><name>Yulia Khalniyazova</name></author><summary type="html"><![CDATA[Here I describe a framework for understanding quantum computer architecture and explore two examples of existing architectures.]]></summary></entry><entry><title type="html">Bad premise for a good argument</title><link href="https://vveiln.github.io/2026/07/23/post.html" rel="alternate" type="text/html" title="Bad premise for a good argument" /><published>2026-07-23T00:00:00+00:00</published><updated>2026-07-23T00:00:00+00:00</updated><id>https://vveiln.github.io/2026/07/23/post</id><content type="html" xml:base="https://vveiln.github.io/2026/07/23/post.html"><![CDATA[<p>I’m currently reading “Ruined by design” by Mike Monteiro and I’d like to comment on one argument I saw in the book and see often in different contexts.</p>

<blockquote>
  <p>“Every human being on this planet is obligated to do their best to leave this planet in better shape than we found it. Everyone on the planet is obligated to respect every other human being on this planet.”</p>
</blockquote>

<p>I can’t really agree with this. Why are they <em>obligated</em>?</p>

<p>I think people who make such statements are really trying to say “I’m scared of what happens if the majority acts differently. People will start killing each other, the planet will die soon, and it scares me”.</p>

<p>I can totally relate to the sentiment. It scares me too. I want people to respect each other, I want people to respect me. I want people to do no harm to each other and I want people to do no harm to me.</p>

<p>We’ve collectively encoded some of these values into law: don’t kill, don’t steal, don’t harm. That is good. But the fact that we chose these rules doesn’t make them objectively <em>right</em>, they are just our <em>shared preferences</em>. We could have chosen differently. We don’t always choose well.</p>

<p>So when someone says we’re ‘obligated’ to act a certain way, they’re treating it as self-evident. If your position is better, prove it.</p>

<p>And if you don’t want to prove anything, it is fine. Just acknowledge you’re speaking to people who already share your values. Most people who pick up the book probably already do.</p>]]></content><author><name>Yulia Khalniyazova</name></author><summary type="html"><![CDATA[I'm currently reading "Ruined by Design" by Mike Monteiro and I'd like to comment on one argument I saw in the book.]]></summary></entry></feed>