[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"content-index":3,"content-layer:quantum-computing:deepen":1603},{"release":4,"domains":9,"concepts":110,"edges":1491,"journeys":1600,"sources":1601,"glossary":1602,"lean":147},{"releaseId":5,"mode":6,"createdAt":7,"manifestHash":8},"remote-mudu450b","approved","2026-09-23T08:22:02.075Z","fce59c30108646721021f0954975dd55d032d83b2d66300a4bcf32cfc54206cb",[10,40,62,76,86,100],{"id":11,"title":12,"description":13,"order":14,"areas":15},"mathematics","Mathematics","Numbers, shapes, patterns and data — and the reasoning that connects them.",0,[16,20,24,28,32,36],{"id":17,"title":18,"description":19},"math-number","Numbers","Reading, writing and comparing large numbers, their properties, the four operations and the order we do them in.",{"id":21,"title":22,"description":23},"math-factors","Factors and multiples","Prime and composite numbers, twin primes and co-primes, HCF and LCM.",{"id":25,"title":26,"description":27},"math-patterns","Patterns","Finding the rule behind number and shape patterns, and using it to predict.",{"id":29,"title":30,"description":31},"math-geometry","Geometry","Shapes and solids, lines and rays, and the angles they make.",{"id":33,"title":34,"description":35},"math-measurement","Measurement","Measuring and constructing angles with a protractor, ruler and compass.",{"id":37,"title":38,"description":39},"math-data","Data handling","Collecting and organising data, and summarising it with mean, median, mode and range.",{"id":41,"title":42,"description":43,"order":44,"areas":45},"matter-energy","Physics","Light, sound, forces, energy and electricity — how the physical world behaves.",1,[46,50,54,58],{"id":47,"title":48,"description":49},"phys-light","Light","How light travels, what it does when it meets things, and why we see colour.",{"id":51,"title":52,"description":53},"phys-sound","Sound","Vibrations that travel through materials, and how we hear them.",{"id":55,"title":56,"description":57},"phys-forces","Forces and motion","Pushes, pulls and the force that holds moons, planets and falling apples.",{"id":59,"title":60,"description":61},"phys-electricity","Electricity and magnetism","Charge, circuits, power and magnets.",{"id":63,"title":64,"description":65,"order":66,"areas":67},"earth-space","Earth and space","Our planet, its oceans and skies, and the Sun and Moon that move them.",2,[68,72],{"id":69,"title":70,"description":71},"earth-space-astro","Sun, Moon and sky","What we see in the sky, why it changes, and what is really moving.",{"id":73,"title":74,"description":75},"earth-oceans","Oceans","Seas, coasts and the daily rise and fall of the tide.",{"id":77,"title":78,"description":79,"order":80,"areas":81},"living-world","Living world","Bodies, plants, animals and the systems that keep them alive.",3,[82],{"id":83,"title":84,"description":85},"bio-body","The human body","What is inside you, where it sits, and how the parts work together.",{"id":87,"title":88,"description":89,"order":90,"areas":91},"people-society","People and society","How people organise themselves, and what happens when they travel, trade and rule.",4,[92,96],{"id":93,"title":94,"description":95},"soc-government","Government and citizenship","Who makes the rules, who carries them out, and how people have a say.",{"id":97,"title":98,"description":99},"soc-exploration","Exploration and encounter","Why people set out into the unknown, and what followed for everyone involved.",{"id":101,"title":102,"description":103,"order":104,"areas":105},"technology","Technology","How tools, machines and computers are designed and used.",5,[106],{"id":107,"title":108,"description":109},"tech-engineering","Engineering and power","Designing machines, structures and energy systems.",[111,179,239,286,339,389,438,488,540,587,637,689,738,788,827,876,928,979,1029,1076,1125,1177,1212,1246,1296,1344,1379,1411,1444],{"id":112,"slug":112,"title":113,"question":114,"promise":115,"domains":116,"areas":117,"keywords":118,"status":139,"layers":140,"questionBank":172},"human-body-anatomy","Anatomy of the human body","What is inside you, and where exactly does it all sit?","A guided tour of the body: bones that hold you up, muscles that move you, and the organs packed inside — what each one is, where it sits, and how big it really is.",[77],[83],[119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138],"anatomy","organ","skeleton","bone","muscle","heart","lungs","brain","stomach","liver","kidney","intestine","skin","joint","ribcage","spine","diaphragm","cell","tissue","body systems","available",[141,149,155,161,167],{"depth":142,"revision":44,"title":143,"subtitle":144,"summary":145,"estimatedMinutes":146,"reviewed":147,"reviewMethod":148},"discover","A guided tour of the body you live in","What is inside you, where it sits, and how big it really is","Climb the ladder from cells to organ systems, learn the words anatomists use for where things are, meet the 206 bones and their joints, find out why a muscle can only ever pull, and take an organ-by-organ tour with real sizes and positions — then measure your own body.",38,true,"owner_bulk",{"depth":150,"revision":44,"title":151,"subtitle":152,"summary":153,"estimatedMinutes":154,"reviewed":147,"reviewMethod":148},"understand","How the body is put together","Tissues, bone, joints, muscle and the cavities that hold the organs","Go one level below the organs to the four tissue types they are built from, learn the direction words and the standard pose they are measured from, see why bone is a living composite, count the skeleton to 206, and place every major organ in its cavity with its mass.",42,{"depth":156,"revision":44,"title":157,"subtitle":158,"summary":159,"estimatedMinutes":160,"reviewed":147,"reviewMethod":148},"investigate","Predict it, then test it","Seven claims about your body, tested with paper, a tape measure and real class data","Guess before you look: does a hollow tube beat a solid rod, does height equal arm span for everyone, can a bone reveal a stranger’s height, does exercise raise every pulse equally, are you really symmetric, and does your shoulder really out-move your hip? Seven hands-on tests against real evidence.",36,{"depth":162,"revision":44,"title":163,"subtitle":164,"summary":165,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"deepen","Why it works: levers, remodelling and a history of being corrected","Lever mechanics in every joint, bone that rebuilds under load, and how anatomy overturned a thousand years of error","Treat every muscle-moved bone as a lever and see why the body favours the class that trades force for speed. Meet bone that rebuilds along its real loads, the genuine edge cases in \"206 bones\", and how Vesalius corrected centuries of Galen’s animal-based errors.",40,{"depth":168,"revision":44,"title":169,"subtitle":170,"summary":171,"estimatedMinutes":146,"reviewed":147,"reviewMethod":148},"extend","Beyond the syllabus: animals, projects, puzzles and careers","Other body plans, three things to build, puzzles worth reasoning through, and where this knowledge earns a living","Compare your body plan with a giraffe, a bird, a snake and a boneless octopus; build a working paper hand and a life-size organ map; solve puzzles spanning the whole topic; meet seven careers built on this knowledge; finish with open questions.",{"count":173,"sections":174,"levels":175},79,10,{"foundation":176,"core":177,"stretch":178,"challenge":174},22,32,15,{"id":180,"slug":180,"title":181,"question":182,"promise":183,"domains":184,"areas":185,"keywords":186,"status":139,"layers":207,"questionBank":231},"angles","Angles","How much does a door turn when it opens — and how do we measure a turn?","What an angle is, types of angles, angle pairs (complementary, supplementary, linear pairs, vertically opposite) and how to use them to find missing angles.",[11],[29],[187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206],"angle","vertex","arm","degrees","acute","right angle","obtuse","straight angle","reflex","complete angle","complementary","supplementary","linear pair","vertically opposite","adjacent angles","angles at a point","clock angles","transversal","parallel lines","angle sum of a triangle",[208,213,218,222,227],{"depth":142,"revision":44,"title":209,"subtitle":210,"summary":211,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"Angles are turns","Doors, clocks, scissors and compass directions: meet the angle and learn to name its size","See an angle as a turn and as two arms meeting at a vertex. Measure turns in degrees (full 360°, half 180°, quarter 90°), sort angles into seven types, turn through N, E, S, W, read angles on a clock and meet angle partners.",35,{"depth":150,"revision":44,"title":214,"subtitle":215,"summary":216,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Naming, sorting and pairing angles","Precise definitions, the seven types, and the angle pairs that let you find what you cannot measure","Define an angle as two rays with a common vertex, name it with ∠ABC, and use degrees and landmark angles. Pin down the seven types, clock and compass angles, then adjacent, complementary, supplementary, linear-pair, vertically opposite and around-a-point angles.",45,{"depth":156,"revision":44,"title":219,"subtitle":220,"summary":221,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Is it always true? Testing angle ideas","Predict, test with labs and numbers, hunt counterexamples and find the reasons behind angle patterns","Investigate angle estimation, sums of angle types, complement and supplement patterns, linear pairs and their bisectors, crossing lines, clock-hand puzzles, turning walks around shapes and the tear-the-corners experiment, sorting claims into always, sometimes and never.",{"depth":162,"revision":44,"title":223,"subtitle":224,"summary":225,"estimatedMinutes":226,"reviewed":147,"reviewMethod":148},"Why angles behave: proofs, parallels and polygons","From Babylonian 360 to Euclid's proofs: transversals, triangle and polygon angle sums, and hard missing-angle problems","Why a full turn is 360°, how to write a proof with reasons, why vertically opposite angles are equal, the angles made by a transversal on parallel lines and their converses, the triangle and polygon angle sums, bends and zigzags between parallels, and where 180° fails.",55,{"depth":168,"revision":44,"title":228,"subtitle":229,"summary":230,"estimatedMinutes":226,"reviewed":147,"reviewMethod":148},"Angles at work and play","Clock formulas, exterior angles, bearings, radians, real-world angles, olympiad puzzles and projects","Use |30h − 5.5m| for any clock time, prove and use the exterior angle property, navigate with bearings and runway numbers, meet the radian, see angles in ramps, ladders, bowling and pie charts, and tackle olympiad-style angle chases, projects and open questions.",{"count":232,"sections":233,"levels":234},80,9,{"foundation":235,"core":236,"stretch":237,"challenge":238},20,28,21,11,{"id":240,"slug":240,"title":241,"question":242,"promise":243,"domains":244,"areas":245,"keywords":246,"status":139,"layers":261,"questionBank":281},"body-systems","Body systems and how they connect","No organ works alone — so how does a mouthful of roti reach your toes as energy?","Digestive, circulatory, respiratory, nervous, muscular, skeletal and excretory systems, and the handovers between them that keep you alive every second.",[77],[83],[247,248,249,250,251,252,253,254,255,256,257,195,258,259,260],"digestive system","circulatory system","respiratory system","nervous system","excretory system","muscular system","skeletal system","blood","oxygen","nutrients","homeostasis","heart rate","breathing","interconnected",[262,266,270,273,277],{"depth":142,"revision":44,"title":263,"subtitle":264,"summary":265,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"Seven teams, one body","What each system does, and where it hands the work to the next one","Meet the organ systems one at a time — digestive, respiratory, circulatory, excretory, nervous, muscular and skeletal — then follow a roti and a breath across the hand-over points where each system passes its work to the next.",{"depth":150,"revision":44,"title":267,"subtitle":268,"summary":269,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"How the systems work, and how they hand over","One design used six times: thin wall, huge surface, steep difference","Go inside each system: enzymes and the chemical works, the pressure trick that moves air, two circuits through a four-chambered heart, filter-and-reclaim kidneys, the reflex arc and the nerve-to-muscle gap — then follow a breath all the way to a working cell.",{"depth":156,"revision":44,"title":157,"subtitle":271,"summary":272,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"Reaction time, a real enzyme test, exercise data and a fever that is not a malfunction","Turn the claims from earlier layers into experiments you can actually run: a ruler-drop reaction test, an iodine test for digested starch, pulse and breathing data before and after exercise, and a look at why a fever is a controlled response rather than a failure.",{"depth":162,"revision":44,"title":274,"subtitle":275,"summary":276,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Where the tidy rule bends","The mathematics of a thin wall, bone's double life, the lymphatic system, and why some hand-overs must be prevented","Quantify why hand-over barriers must be thin, meet the lymphatic system that returns leaked fluid and carries digested fat, see bone as a blood factory and calcium bank, and look at clotting and the blood-brain barrier as hand-overs the body deliberately controls or resists.",{"depth":168,"revision":44,"title":278,"subtitle":279,"summary":280,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"History, machines and weightlessness","Harvey's arithmetic, the stethoscope and ECG, three ways to image the body, artificial hand-overs, and bodies in orbit","Meet the arithmetic that proved blood circulates, the instruments that let doctors listen to and image a living body without cutting it, machines that rebuild a failed hand-over, what microgravity does to every system at once, and a few careers and open questions this topic leads to.",{"count":173,"sections":233,"levels":282},{"foundation":176,"core":283,"stretch":284,"challenge":285},25,19,13,{"id":287,"slug":287,"title":38,"question":288,"promise":289,"domains":290,"areas":291,"keywords":292,"status":139,"layers":313,"questionBank":335},"data-handling","What is a typical value — and how can one number summarise a whole class?","Collecting and organising data, tally marks and frequency tables, bar graphs, and summarising data with mean, median, mode and range.",[11],[37],[293,294,295,296,297,298,299,300,301,302,303,304,305,306,307,308,309,310,311,312],"data","mean","median","mode","range","average","tally","frequency table","bar graph","pictograph","pie chart","double bar graph","grouped data","outlier","survey","probability","census","rainfall","batting average","raw data",[314,318,322,326,330],{"depth":142,"revision":44,"title":315,"subtitle":316,"summary":317,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"Counting what matters: meeting data","From a messy list of answers to one number that tells the story","Ask a question, collect answers, and turn a jumble of raw data into tally marks, tables, pictographs and bar graphs. Then meet four friendly numbers that sum up a whole group: the fair share (mean), the middle (median), the most common (mode) and the spread (range).",{"depth":150,"revision":44,"title":319,"subtitle":320,"summary":321,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Organise, picture, summarise: how the methods work","Kinds of data, tables and graphs done properly, and exact methods for mean, median, mode and range","Tell categorical from numerical data, build self-checking frequency tables, choose a key or scale for pictographs and bar graphs, and use exact methods for mean, median (odd and even counts), mode (two modes or none) and range, even from a frequency table.",{"depth":156,"revision":44,"title":323,"subtitle":324,"summary":325,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"What happens if…? Experiments with averages","Predict, change the data, and test: outliers, shifts, missing values and datasets built to order","Treat averages like a science experiment. Predict what adding a value, an outlier, or a change to every value does to the mean, median, mode and range, then test it in the labs. Build data sets to order, hunt missing values and compare real Indian data.",{"depth":162,"revision":44,"title":327,"subtitle":328,"summary":329,"estimatedMinutes":226,"reviewed":147,"reviewMethod":148},"Why averages work, and which one to trust","Balance points, proofs, grouped data, combined groups and the art of choosing an average","Prove the mean is a balance point and how it reacts to shifts and scaling. Combine groups correctly, handle grouped data with class intervals, read double bar graphs, and choose between mean, median and mode with outliers, cricket averages and average speeds. Plus a history of statistics in India.",{"depth":168,"revision":44,"title":331,"subtitle":332,"summary":333,"estimatedMinutes":334,"reviewed":147,"reviewMethod":148},"Data in the wild: pie charts, tricks, chance and projects","Draw pie charts, catch misleading graphs, talk about chance, and investigate real Indian data","Turn data into pie charts with angles, spot graphs that mislead, describe chance from impossible to certain, and run real projects on electricity bills, the census and monsoon rain. Think about privacy and fairness in data, meet careers built on data, and try olympiad-style puzzles.",60,{"count":232,"sections":233,"levels":336},{"foundation":337,"core":338,"stretch":176,"challenge":174},18,30,{"id":340,"slug":340,"title":341,"question":342,"promise":343,"domains":344,"areas":345,"keywords":346,"status":139,"layers":362,"questionBank":383},"eclipses","Eclipses","If the Moon goes round Earth every month, why isn't there an eclipse every month?","An eclipse is a shadow falling exactly where it can be seen. Learn the geometry of umbra and penumbra, why the Moon's tilted orbit makes eclipses rare, and how to watch one safely.",[63],[69],[347,348,349,350,351,352,353,354,355,356,357,358,359,360,361],"eclipse","solar eclipse","lunar eclipse","umbra","penumbra","annular","totality","syzygy","nodes","orbit tilt","Saros","corona","blood moon","eye safety","shadow",[363,367,371,375,379],{"depth":142,"revision":44,"title":364,"subtitle":365,"summary":366,"estimatedMinutes":338,"reviewed":147,"reviewMethod":148},"An eclipse is a shadow that finds you","Two shadows, two kinds of eclipse, and how to watch one without hurting your eyes","Meet eclipses as what they really are: shadows. Learn whose shadow falls on what in solar and lunar eclipses, why the eclipsed Moon turns red, why we don't get one every month, and the safe ways to watch the Sun.",{"depth":150,"revision":44,"title":368,"subtitle":369,"summary":370,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"The geometry of a shadow in space","Umbra and penumbra, apparent sizes, nodes and seasons — and the reasons behind every safety rule","Work out the actual geometry: how long each shadow cone is, why the Moon's only just reaches us, why the discs match to 3%, how far from a node an eclipse can happen, why the Moon turns red, and the physics behind every solar viewing rule.",{"depth":156,"revision":44,"title":372,"subtitle":373,"summary":374,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"Build it, test it, try to break it","A lamp-and-balls model, hands-on measurements, and predictions checked against real eclipses","Hands-on layer: build a scale model of the Earth-Moon-Sun system, test the new-moon\u002Ffull-moon rule and the shadow-width formula for yourself, find the tilt's hidden threshold, build a pinhole projector and check its numbers, and plan around three real upcoming eclipses.",{"depth":162,"revision":44,"title":376,"subtitle":377,"summary":378,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"The Saros cycle, and two eclipses that changed physics","The Saros arithmetic, the astronomers who computed it, and how a belief should really be tested","Deeper reasoning: rebuild the 1.474° eclipse limit term by term, derive the Saros and exeligmos cycles from three different lunar months, see how Aryabhata and Brahmagupta actually computed eclipses, and examine the two solar eclipses that discovered helium and tested general relativity.",{"depth":168,"revision":44,"title":380,"subtitle":381,"summary":382,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"The same shadow rule, everywhere in the Solar System","Moons too small to eclipse, a moon that eclipses constantly, transits at home, and other worlds' planets","Take the eclipse geometry beyond Earth: why Phobos and Deimos only ever transit the Sun from Mars, why Io causes true eclipses on Jupiter routinely, how Mercury and Venus transit the Sun from Earth, Venus's 243-year transit rhythm, and how the same trick finds other stars' planets.",{"count":384,"sections":385,"levels":386},68,8,{"foundation":235,"core":387,"stretch":388,"challenge":385},24,16,{"id":390,"slug":390,"title":391,"question":392,"promise":393,"domains":394,"areas":395,"keywords":396,"status":139,"layers":416,"questionBank":437},"electricity","Electricity","What actually happens between the power station and the switch under your finger?","Electricity is charge on the move. Learn what pushes it, what resists it, how it is made and delivered, what it costs, and how to stay safe around it.",[41,101],[59,107],[390,397,398,399,400,401,402,403,404,405,406,407,408,409,410,411,412,413,414,415],"voltage","current","resistance","Ohm's law","circuit","AC","DC","generator","power station","grid","transformer","kWh","electricity bill","safety","MCB","earth wire","battery","conductor","insulator",[417,421,425,429,433],{"depth":142,"revision":44,"title":418,"subtitle":419,"summary":420,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"Electricity is charge on the move","From a balloon on your hair to a day that runs on it","Meet the charges hiding in every atom, see why a doorknob spark and lightning are the same idea, discover why slow electrons still light a bulb instantly, build circuits that break, and learn the first rules for staying safe.",{"depth":150,"revision":44,"title":422,"subtitle":423,"summary":424,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"The big three: voltage, current, resistance","The push, the flow and the pushback, and the one rule that ties them together","Build the pump-and-pipe picture of a circuit, then meet voltage (the push), current (the flow) and resistance (the pushback) with real numbers from AA cells to lightning. Finish with Ohm's law, V = I × R, and the mix-ups it clears up.",{"depth":156,"revision":44,"title":426,"subtitle":427,"summary":428,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"Circuits you can test","Fair tests, meters, series and parallel, Ohm's law, fuses and fruit batteries","Design fair circuit tests, place ammeters and voltmeters correctly, compare series and parallel bulbs, test Ohm's law and see a filament bulb break it, work out when an MCB trips, and build a safe lemon battery.",{"depth":162,"revision":44,"title":430,"subtitle":431,"summary":432,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"How it's made and how it reaches you","From Faraday's spinning magnets to the socket on your wall","Follow electricity from a spinning magnet in a power station, through transformers and 765 kV lines, down to the 230 V socket in your room. Learn why the grid runs on AC at 50 Hz, why it transmits at high voltage, and why supply must match demand every second.",{"depth":168,"revision":44,"title":434,"subtitle":435,"summary":436,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"Power, bills, safety and the future","From watts on a rating plate to units on your bill, the milliamps that matter, and the grid that is coming","Use P = V × I and E = P × t to read rating plates and work out a real electricity bill in units (kWh). Learn why current through the body is what injures, how earth pins, MCBs and RCCBs protect you, what to do in a shock emergency, and how solar, storage and smart meters are changing the grid.",null,{"id":439,"slug":439,"title":440,"question":441,"promise":442,"domains":443,"areas":444,"keywords":445,"status":139,"layers":463,"questionBank":485},"exploration","Exploration: reasons and consequences","What made people sail into oceans they could not map — and who paid for it?","Curiosity, trade, faith, gold and rivalry sent people across oceans. Follow the voyages, the technology that made them possible, and the consequences — for those who travelled and for those already there.",[87],[97],[439,446,447,448,449,450,451,452,453,454,455,456,457,458,459,460,461,462],"voyage","navigation","trade route","spices","Vasco da Gama","Columbus","Zheng He","Silk Road","colonisation","Columbian exchange","monsoon winds","astrolabe","compass","cartography","empire","consequences","indigenous peoples",[464,468,473,477,481],{"depth":142,"revision":44,"title":465,"subtitle":466,"summary":467,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"Why sail into an ocean nobody has mapped?","Reasons, routes and results, told from both ends of the voyage","Meet exploration honestly: what the word means and why 'discovery' misleads, six reasons people set out, the busy Indian Ocean world before European ships, how sailors found their way, four voyages worth knowing, and what followed - new foods, new maps, disease, slavery and empire.",{"depth":150,"revision":44,"title":469,"subtitle":470,"summary":471,"estimatedMinutes":472,"reviewed":147,"reviewMethod":148},"How the navigator's toolkit actually works","Mechanisms behind the voyages: instruments, sails, clocks, charts and the economics of a monopoly","Go under Discover's story to the mechanisms: how a compass, kamal, astrolabe, lateen sail and sternpost rudder actually work, why longitude needed a clock and took decades to solve, how flat maps must distort a round Earth, and why a royal charter let a trading company become a ruler.",50,{"depth":156,"revision":44,"title":474,"subtitle":475,"summary":476,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"Predict it, try it, compare it, test it","Lab-heavy investigations that check what the Discover layer told you","Compare stated reasons with actual results for Columbus and Zheng He, run a monsoon 'what if', judge whether one number sums up a disputed history, sort evidence against a claim about da Gama, read a paraphrased passage from two sides, and test sweeping generalisations against real voyages.",{"depth":162,"revision":44,"title":478,"subtitle":479,"summary":480,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Mechanism, harder numbers, and how historians know","Why the monsoon reverses, how clock drift compounds, and the method behind contested figures","Go beneath Discover's facts into mechanism and method: why the monsoon reverses, how clock drift compounds over a long voyage, an edge case in kamal readings, how historians back-project contested figures, how to weigh one account against another, and what shipwreck years teach about mean vs median.",{"depth":168,"revision":44,"title":482,"subtitle":483,"summary":484,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Beyond the horizon: exploration to today","Cook, the poles, space, the deep sea, and the questions nobody has answered yet","Carries exploration from Cook's Pacific voyage to today: the race to the poles and the treaty that followed, leaving Earth's gravity for the Moon and beyond, the deepest ocean trench, and the hardest open questions - who owns what nobody lives on, and who decides.",{"count":486,"sections":233,"levels":487},75,{"foundation":178,"core":236,"stretch":176,"challenge":174},{"id":489,"slug":489,"title":490,"question":491,"promise":492,"domains":493,"areas":494,"keywords":495,"status":139,"layers":515,"questionBank":536},"four-operations","Four operations","When should you add, subtract, multiply or divide — and how do you know your answer makes sense?","Addition, subtraction, multiplication and division with large numbers, choosing the right operation in real problems, and checking answers by estimating and by inverse operations.",[11],[17],[496,497,498,499,500,501,502,503,504,505,506,507,508,509,510,511,512,513,514],"addition","subtraction","multiplication","division","word problems","estimation","inverse operations","quotient","remainder","dividend","divisor","product","sum","difference","regrouping","long division","long multiplication","unitary method","word problems in rupees",[516,520,524,528,532],{"depth":142,"revision":44,"title":517,"subtitle":518,"summary":519,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"Four ways to change a number","Adding, subtracting, multiplying and dividing: what each one means and when to use it","Meet the four operations through a kirana-shop trip, cricket scores, egg trays and shared laddoos. Learn what each operation means, how they undo each other, how to pick the right one from a story, and how to check that an answer is sensible.",{"depth":150,"revision":44,"title":521,"subtitle":522,"summary":523,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"How the column methods work","Carrying, borrowing, long multiplication and long division, and why every step is allowed","Learn the exact name for every part of a calculation, then master column addition and subtraction up to crores, long multiplication, long division with remainders and zeros in the quotient, checking with inverse operations, and working with money and units.",{"depth":156,"revision":44,"title":525,"subtitle":526,"summary":527,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Predict, test, check","Estimating first, changing the numbers, making sense of remainders and catching keyword traps","Predict before you calculate and test with labs and tables: estimate sums and products, see what happens when numbers change, decide what a remainder means in a story, catch misleading keywords and check answers by undoing them.",{"depth":162,"revision":44,"title":529,"subtitle":530,"summary":531,"estimatedMinutes":226,"reviewed":147,"reviewMethod":148},"Why the methods work","Regrouping, the distributive property, the division algorithm, checks, proportion and the history behind them","Prove why carrying, borrowing, long multiplication and long division work, meet the division algorithm and why dividing by zero is impossible, check with casting out nines, use the unitary method wisely, and solve India-sized multi-step problems.",{"depth":168,"revision":44,"title":533,"subtitle":534,"summary":535,"estimatedMinutes":472,"reviewed":147,"reviewMethod":148},"Other ways to calculate, and harder puzzles","Lattices, Vedic-style shortcuts, doubling, binary, classic puzzles, olympiad problems and real projects","Try the lattice, Napier's bones, Vedic-style shortcuts and Russian peasant multiplication and see why each works. Crack classic puzzles and olympiad problems, then plan real projects: a trip budget, a kirana bill, a harvest and a run chase.",{"count":537,"sections":385,"levels":538},74,{"foundation":178,"core":539,"stretch":176,"challenge":385},29,{"id":541,"slug":541,"title":542,"question":543,"promise":544,"domains":545,"areas":546,"keywords":547,"status":139,"layers":563,"questionBank":584},"gravity","Gravity","Why does everything fall down — and what is the Moon falling towards?","The force that pulls an apple to the ground is the same one that keeps the Moon circling Earth. Meet mass and weight, free fall, orbits and why astronauts float.",[41],[55],[541,548,549,550,551,552,553,554,555,556,557,558,559,560,561,562],"mass","weight","free fall","orbit","force","Newton","air resistance","g","acceleration","satellite","weightlessness","planet","tides","escape velocity","centre of mass",[564,568,572,576,580],{"depth":142,"revision":44,"title":565,"subtitle":566,"summary":567,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"Why does everything fall down?","Meet the pull that drops a pencil, bends the Moon’s path and holds the sky together","Start with a dropped pencil and end with galaxies. Discover what a force is, why heavy things do not fall faster, how air changes everything, the real difference between mass and weight, and the true reason astronauts float.",{"depth":150,"revision":44,"title":569,"subtitle":570,"summary":571,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"How gravity works: weight, falling and orbits","Mass against weight, g against speed, drag against gravity — and why an orbit is a permanent miss","Turn the story into rules you can use: weight = mass × g, distance = ½ g t², why mass cancels in free fall, how drag sets terminal velocity, Newton’s universal law in words, and the real reason astronauts float.",{"depth":156,"revision":44,"title":573,"subtitle":574,"summary":575,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Test it: predictions, ramps, pendulums and Newton’s own proof","Predict, try, compare and ask \"is it always true?\" — with a ramp, a pendulum, a leaking cup and a spacecraft","Turn gravity into hands-on science: rebuild Galileo’s ramp, design fair tests for mass and shape, weigh the Earth with a pendulum, check whether Newton’s law survives the trip to the Moon, hunt for orbital speed by binary search, and see how ISRO climbs to the Moon and Mars one burn at a time.",{"depth":162,"revision":44,"title":577,"subtitle":578,"summary":579,"estimatedMinutes":472,"reviewed":147,"reviewMethod":148},"The mathematics behind every number in this topic","G, orbits derived from first principles, Newton’s Moon test in full, and the coincidence Einstein could not ignore","Meet Newton’s law with its constant G, derive orbital and escape speed from scratch, redo Newton’s Moon test in full, explore why gravitational and inertial mass are equal, see why g is not uniform on Earth, and look at the mechanics behind ISRO’s orbit-raising missions.",{"depth":168,"revision":44,"title":581,"subtitle":582,"summary":583,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Curved spacetime, black holes and the questions nobody has answered yet","Einstein’s radical idea, tested and confirmed — and an honest look at where gravity’s biggest mysteries still are","Go beyond Newton to Einstein: gravity as curved spacetime, the rubber-sheet picture and its flaws, the tests that confirmed general relativity, black holes, gravitational waves, orbital puzzles from tidal locking to dark matter, and open questions with real projects.",{"count":585,"sections":233,"levels":586},70,{"foundation":388,"core":387,"stretch":235,"challenge":174},{"id":588,"slug":588,"title":589,"question":590,"promise":591,"domains":592,"areas":593,"keywords":594,"status":139,"layers":613,"questionBank":634},"hcf-and-lcm","HCF and LCM","When will two blinking lights flash together again — and what is the biggest tile that fits a floor exactly?","Highest common factor and lowest common multiple by listing, prime factorisation and division, their link HCF × LCM = product, and real problems that need them.",[11],[21],[595,596,597,598,599,600,601,602,603,604,605,606,607,608,609,610,500,611,612],"HCF","LCM","GCD","GCF","highest common factor","lowest common multiple","least common multiple","common factors","common multiples","prime factorisation","Venn diagram","long division method","Euclid's algorithm","common division method","co-prime","HCF × LCM","remainder problems","fractions",[614,618,622,626,630],{"depth":142,"revision":44,"title":615,"subtitle":616,"summary":617,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"Sharing and meeting: meet the HCF and LCM","The biggest equal pieces and the next time things line up","Start from two puzzles, the biggest tile for a courtyard and the next time two lights flash together, and discover factors, multiples, common factors, common multiples, the HCF and the LCM, and how to tell which one a problem needs.",{"depth":150,"revision":44,"title":619,"subtitle":620,"summary":621,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Four ways to find the HCF and LCM","Listing, prime factors, long division and the ladder, and why they work","Precise definitions, then four methods: listing, prime factorisation with a Venn picture, long (continued) division for the HCF and common division for the LCM. Three numbers, the rule HCF × LCM = product, co-primes, fractions and the classic mix-ups.",{"depth":156,"revision":44,"title":623,"subtitle":624,"summary":625,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Predict, test and explain: HCF and LCM patterns","Always, sometimes or never? Find out with your own experiments","Make predictions and test them: when the LCM equals the product, why neighbours are co-prime, how HCF × LCM = a × b holds for two numbers but not three, what scaling does, how remainder puzzles work, and how changing a word problem changes the answer.",{"depth":162,"revision":44,"title":627,"subtitle":628,"summary":629,"estimatedMinutes":226,"reviewed":147,"reviewMethod":148},"Why it works: proofs, Euclid and the edges","Unique prime recipes, the product rule, Euclid’s algorithm and Bézout","Proofs in plain language: unique prime factorisation, why HCF takes smallest powers and LCM largest, why HCF × LCM = a × b (and why not for three numbers), why Euclid’s method works and how fast it is, Bézout’s identity, edge cases, harder problems and history.",{"depth":168,"revision":44,"title":631,"subtitle":632,"summary":633,"estimatedMinutes":334,"reviewed":147,"reviewMethod":148},"Cycles, gears and puzzles: HCF and LCM in the wild","Calendars, cicadas, tabla, bicycles, jugs, screens and olympiad problems","Expeditions beyond the textbook: cycles with head starts, calendars and planetary alignments (and why they are not LCMs), prime-cycle cicadas, gears and bicycle chains, tala rhythms, water jugs, ancient remainder puzzles, screen ratios, fractions, olympiad problems, careers and open questions.",{"count":173,"sections":385,"levels":635},{"foundation":235,"core":636,"stretch":337,"challenge":174},31,{"id":638,"slug":638,"title":639,"question":640,"promise":641,"domains":642,"areas":643,"keywords":644,"status":139,"layers":665,"questionBank":686},"government-india","How government works in India","Who decides what a country does — and where does a citizen fit in?","Parliament, the President and the Prime Minister, states and panchayats, courts and elections: how India makes its laws, carries them out and settles disputes, and how people have a say.",[87],[93],[645,646,647,648,649,650,651,652,653,654,655,656,657,658,659,660,661,662,663,664],"government","democracy","Parliament","Lok Sabha","Rajya Sabha","President","Prime Minister","Supreme Court","election","vote","constitution","panchayat","municipality","state","federal","law","rights","duties","citizen","judiciary",[666,670,674,678,682],{"depth":142,"revision":44,"title":667,"subtitle":668,"summary":669,"estimatedMinutes":338,"reviewed":147,"reviewMethod":148},"Who decides the rules?","From an hour in the school hall to a republic of a hundred and forty crore people","Start with thirty children, one football and no rules, and discover the three jobs every group has to invent: making rules, carrying them out and settling disputes. Then meet India's version — the Constitution, three organs, three levels, and the vote.",{"depth":150,"revision":44,"title":671,"subtitle":672,"summary":673,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"How each part actually works","Parliament's machinery, a bill's journey, the courts' ladder, and the levels beneath the Union","Go inside the institutions Discover introduced: how Parliament questions ministers, how a bill becomes an Act, what a President does that a Prime Minister does not, how courts check Parliament, and how the Union, States, Union Territories and local bodies share the work.",{"depth":156,"revision":44,"title":675,"subtitle":676,"summary":677,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"Test it yourself: does the arithmetic hold up?","Seat share against vote share, real turnout data, and edge cases in how a bill becomes an Act","Put the rules from Understand under pressure: work through seat-versus-vote-share examples, test what happens when the two Houses disagree over a money bill, analyse real turnout data with mean, median and range, and sort everyday problems by the level of government actually responsible.",{"depth":162,"revision":44,"title":679,"subtitle":680,"summary":681,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"Why it is built this way","The amendment procedure's arithmetic, the basic structure doctrine, and the freedom movement's fingerprints","Go after the reasoning: the arithmetic of amending the Constitution, the basic structure doctrine, how judges come to be chosen, the freedom movement's own arguments becoming institutions, and a few genuine edge cases put under pressure.",{"depth":168,"revision":44,"title":683,"subtitle":684,"summary":685,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"Build it, test it, take it further","A mini-constitution, a mock Parliament, coalition puzzles, other countries' choices, and where this knowledge leads","Put the whole topic to work: draft and stress-test a mini-constitution, run a mock Parliament, prove a coalition-counting puzzle, compare India's design with other countries', research your own representatives, and meet real careers and open questions this knowledge connects to.",{"count":687,"sections":385,"levels":688},76,{"foundation":176,"core":636,"stretch":178,"challenge":385},{"id":690,"slug":690,"title":48,"question":691,"promise":692,"domains":693,"areas":694,"keywords":695,"status":139,"layers":713,"questionBank":735},"light","What is light, how does it travel, and why can you see this page at all?","Light travels in straight lines at extraordinary speed, bounces, bends, splits into colours and lets you see. Find out how, and why shadows, mirrors and rainbows behave as they do.",[41],[47],[690,696,697,698,361,699,700,701,702,703,704,705,706,707,708,709,710,350,711,712],"luminous","reflection","refraction","mirror","spectrum","colour","transparent","opaque","translucent","ray","speed of light","rainbow","prism","lens","eye","scattering","laser",[714,718,722,726,730],{"depth":142,"revision":44,"title":715,"subtitle":716,"summary":717,"estimatedMinutes":338,"reviewed":147,"reviewMethod":148},"Light: how you can see anything at all","Sources, straight lines, shadows, mirrors, bent straws and the colours hiding inside white","Meet light as the messenger that carries the world to your eyes: what makes its own light and what only reflects it, why light travels dead straight, how that one fact explains shadows, and first looks at mirrors, bending and the colours inside white light.",{"depth":150,"revision":44,"title":719,"subtitle":720,"summary":721,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"How light behaves: rays, angles and rules you can use","Shadow arithmetic, the law of reflection, what refraction really is, and the two kinds of colour mixing","Turn the facts of Discover into rules that predict. Work out shadow sizes with similar triangles, meet umbra and penumbra, apply the law of reflection to mirrors and periscopes, see why light bends when its speed changes, and separate the two opposite kinds of colour mixing.",{"depth":156,"revision":44,"title":723,"subtitle":724,"summary":725,"estimatedMinutes":154,"reviewed":147,"reviewMethod":148},"Chasing light: measuring, mirroring and bending it on purpose","How fast is light, and how would you find out? Predict and test curved mirrors, lenses, TIR and rainbows.","Step into the shoes of Rømer and Fizeau to measure something that seemed instant, then turn detective on curved mirrors, lenses pushed to a magnifier, total internal reflection in a diamond and a fibre-optic cable, and finally the exact geometry that puts a rainbow at 42 degrees from the Sun.",{"depth":162,"revision":44,"title":727,"subtitle":728,"summary":729,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Precise light: derivations, corrective lenses and the shape of a rainbow","Beyond the syllabus: derive the mirror formula, correct short and long sight, and see why a rainbow sits at 42 degrees.","Follow the speed of light to its modern exact definition, derive the mirror\u002Flens formula from similar triangles, work out lens powers for short and long sight, put numbers on fibre-optic latency, and see why the rainbow's angle is a genuine minimum.",{"depth":168,"revision":44,"title":731,"subtitle":732,"summary":733,"estimatedMinutes":734,"reviewed":147,"reviewMethod":148},"Waves, particles and the light you cannot see","Beyond visible light: wave versus particle, a real chocolate-bar experiment, and looking into the past with light-years.","Step past visible light into the wider spectrum, meet the wave-versus-particle debate (light is genuinely both), measure light's speed with a microwave and a chocolate bar, see how bending stretches every day, and use light-years to look into the past.",44,{"count":232,"sections":233,"levels":736},{"foundation":284,"core":737,"stretch":284,"challenge":178},27,{"id":739,"slug":739,"title":740,"question":741,"promise":742,"domains":743,"areas":744,"keywords":745,"status":139,"layers":763,"questionBank":784},"lines","Lines, rays and line segments","What is the difference between a line, a ray and a segment — and why do railway tracks never meet?","Points, lines, rays and line segments, intersecting, parallel and perpendicular lines, and where we see them in the world.",[11],[29],[746,747,705,748,749,750,751,752,205,753,754,204,755,756,757,758,759,760,761,762],"point","line","line segment","plane","collinear","concurrent","intersecting lines","perpendicular lines","perpendicular bisector","skew lines","horizontal and vertical","measuring segments","parallax error","Euclid's postulates","parallel postulate","vanishing point","railway tracks",[764,768,772,776,780],{"depth":142,"revision":44,"title":765,"subtitle":766,"summary":767,"estimatedMinutes":283,"reviewed":147,"reviewMethod":148},"Straight paths: points, lines, rays and segments","Meet the alphabet of geometry in torch beams, railway tracks and cricket creases","Meet points, line segments, rays and lines through everyday things, then see how two lines can cross, meet at square corners or run side by side forever.",{"depth":150,"revision":44,"title":769,"subtitle":770,"summary":771,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"Names, notation and rules for lines","Precise definitions, careful measuring and the mix-ups they clear up","Pin down point, line and plane; name lines, rays and segments correctly; measure without parallax error; and define collinear, concurrent, parallel and perpendicular lines precisely.",{"depth":156,"revision":44,"title":773,"subtitle":774,"summary":775,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"Test it: predictions about points and lines","Count, fold, measure and hunt for counterexamples","Predict and count how many lines, segments, rays and crossing points some points and lines can make; run a measuring experiment; beat optical illusions; and sort claims into always, sometimes and never true.",{"depth":162,"revision":44,"title":777,"subtitle":778,"summary":779,"estimatedMinutes":472,"reviewed":147,"reviewMethod":148},"Why it must be so: reasoning about lines","Euclid's rules, proofs, counting arguments and the puzzle of parallels","Build geometry from Euclid's postulates, prove key facts about intersecting, parallel and perpendicular lines, count with pairs, and follow the 2,000-year story of the parallel postulate from Alexandria to curved space.",{"depth":168,"revision":44,"title":781,"subtitle":782,"summary":783,"estimatedMinutes":472,"reviewed":147,"reviewMethod":148},"Lines in the wider world","Perspective, skew lines, maps, sport, careers, puzzles and open questions","See parallel lines meet in perspective drawings, find skew lines in rooms and solids, read lines on maps and sports grounds, meet people who use lines at work, and tackle puzzles from pizza cuts to string art.",{"count":232,"sections":233,"levels":785},{"foundation":786,"core":539,"stretch":176,"challenge":787},17,12,{"id":789,"slug":789,"title":790,"question":790,"promise":791,"domains":792,"areas":793,"keywords":794,"status":139,"layers":800,"questionBank":823},"magnets","Magnets: why do some things stick to a magnet and others do not?","A new science topic for learners aged 10 to 12 (Class 5-6, India). Cover: what a magnet is; poles, attraction and repulsion; which materials are magnetic (iron, nickel, cobalt, steel) and which are not (wood, plastic, copper, aluminium); th",[41],[59],[789,795,796,797,798,799],"some","things","stick","magnet","others",[801,807,811,815,819],{"depth":142,"revision":44,"title":802,"subtitle":803,"summary":804,"estimatedMinutes":805,"reviewed":147,"reviewMethod":806},"The Invisible Grip: How Magnets Pull and Push","A journey from fridge magnets to Earth's hidden force — why some things stick and others slip away","This lesson introduces magnets through everyday objects, explains how poles attract and repel, and shows how to test materials for magnetism. Readers will map invisible magnetic fields, make a simple compass, and connect it all to Earth acting as a giant magnet.",90,"per_lesson",{"depth":150,"revision":44,"title":808,"subtitle":809,"summary":810,"estimatedMinutes":805,"reviewed":147,"reviewMethod":806},"The Hidden Army Inside a Magnet","How tiny atomic teams line up to pull, stick or snap — and why heat or a hard knock sends them tumbling","This lesson reveals the invisible world of magnetic domains: why iron sticks but copper slips, how stroking or electricity organises atoms into a magnet, and why heat or hammering destroys that order. It also covers common mix-ups like 'all metals attract' and how to test unknown",{"depth":156,"revision":44,"title":812,"subtitle":813,"summary":814,"estimatedMinutes":805,"reviewed":147,"reviewMethod":806},"The Magnet Investigation Lab","How changing conditions, careful measurement and fair tests reveal what magnets really do","This lesson puts every magnet claim to the test. Learners plan fair comparisons, predict outcomes, gather evidence and use it to decide how magnets behave, how they weaken, and how an electromagnet's design changes its power.",{"depth":162,"revision":44,"title":816,"subtitle":817,"summary":818,"estimatedMinutes":805,"reviewed":147,"reviewMethod":806},"The Invisible Architecture of Magnetism","How atoms, domains, and field lines explain why some materials obey the magnet and others refuse","This lesson traces magnetism from everyday fridge magnets to atomic arrangements and magnetic domains, explaining why iron rushes to a magnet while copper stays still. Readers learn to predict magnetic behaviour, interpret field-line patterns, and calculate simple field relations",{"depth":168,"revision":44,"title":820,"subtitle":821,"summary":822,"estimatedMinutes":805,"reviewed":147,"reviewMethod":806},"The Invisible Push: Magnets at Work and at Scale","From iron filings to maglev trains — how hidden fields, domains and electromagnets shape our world","This lesson explores how magnetic domains explain why some materials become magnets and others do not, then builds to electromagnets, real engineering uses, and how to test magnetism fairly at home. It closes with open questions about magnetic storage and levitation that learners",{"count":824,"sections":66,"levels":825},52,{"foundation":826,"core":337,"stretch":787,"challenge":385},14,{"id":828,"slug":828,"title":829,"question":830,"promise":831,"domains":832,"areas":833,"keywords":834,"status":139,"layers":853,"questionBank":874},"constructing-angles","Measuring and constructing angles","How do you draw an exact 60° angle with only a compass and a ruler?","Reading a protractor correctly, measuring and drawing angles, and constructing 60°, 120°, 90°, 30° and 45° angles and bisectors with a ruler and compass.",[11],[33,29],[835,458,836,837,754,838,839,840,841,842,843,844,845,846,847,848,849,850,851,852],"protractor","construction","angle bisector","60 degrees","90 degrees","120 degrees","45 degrees","30 degrees","geometry box","set square","divider","measuring angles","drawing angles","reflex angle","inner and outer scale","ruler and compass","trisection","constructing triangles",[854,858,862,866,870],{"depth":142,"revision":44,"title":855,"subtitle":856,"summary":857,"estimatedMinutes":338,"reviewed":147,"reviewMethod":148},"Angles you can measure and make","The geometry box, the protractor and the compass trick for an exact 60°","Open the geometry box, learn what a degree is, estimate angles by eye, measure and draw angles with a protractor, and discover how a compass alone can make an exact 60° angle.",{"depth":150,"revision":44,"title":859,"subtitle":860,"summary":861,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"Reading the protractor and the compass constructions","Why the two scales exist, how to measure and draw any angle, and why 60°, 90°, 30° and 45° constructions work","Learn the precise protractor method (and the wrong-scale trap), measure and draw reflex angles, copy lengths with a compass, and construct 60°, 120°, 90°, 30° and 45° angles and perpendicular bisectors with the reason each one works.",{"depth":156,"revision":44,"title":863,"subtitle":864,"summary":865,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"Test it: estimates, radii and angle recipes","Predict, try and check: what really changes an angle, and what never does","Predict and test: does arm length matter, what does a wrong-scale reading look like, how good is your eye, does the compass radius matter, which angles can bisecting and set squares reach, how accurate can a check be, and why bisectors always work.",{"depth":162,"revision":44,"title":867,"subtitle":868,"summary":869,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Why the constructions work","Proofs behind the recipes, edge cases, accuracy and the problems the Greeks could not solve","Find out why each compass construction is exact: equilateral triangles for 60°, congruent triangles for bisectors, equidistant points for perpendiculars. Then test edge cases, measure reflex angles, analyse errors and meet the impossible trisection problem.",{"depth":168,"revision":44,"title":871,"subtitle":872,"summary":873,"estimatedMinutes":472,"reviewed":147,"reviewMethod":148},"Triangles, polygons and the impossible angle","Build triangles and regular polygons, meet Gauss's 17-gon, and find out why 20° can never be constructed","Construct triangles from SSS, SAS and ASA, draw regular polygons from a circle, discover which polygons and whole-degree angles are constructible (multiples of 3°), meet the trisection problem, and use angles in projects, puzzles and careers.",{"count":537,"sections":233,"levels":875},{"foundation":178,"core":338,"stretch":284,"challenge":174},{"id":877,"slug":877,"title":878,"question":879,"promise":880,"domains":881,"areas":882,"keywords":883,"status":139,"layers":903,"questionBank":924},"patterns","Number and shape patterns","How can you predict the 100th term without drawing 100 pictures?","Spotting rules in number sequences and growing shape patterns, describing them in words and symbols, and using the rule to predict.",[11],[25],[877,884,885,886,887,888,889,890,891,892,893,894,895,896,897,898,899,900,901,902],"sequence","rule","term","nth term","repeating patterns","growing patterns","arithmetic sequence","geometric sequence","square numbers","cube numbers","triangular numbers","Fibonacci","Pascal's triangle","matchstick patterns","odd numbers","even numbers","magic squares","kolam","algebra",[904,908,912,916,920],{"depth":142,"revision":44,"title":905,"subtitle":906,"summary":907,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"What comes next? Meeting patterns","Bangles, kolam borders, calendars, matchsticks and the rules that make them","Meet repeating and growing patterns in beads, rangoli, calendars and the hundred square. Find the unit, find the difference, describe the rule in words, and use jumps to predict terms far ahead.",{"depth":150,"revision":44,"title":909,"subtitle":910,"summary":911,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Rules, terms and sequences","Arithmetic and geometric sequences, special numbers, digit patterns and shape rules","Learn the precise language of sequences, the difference method for finding rules, arithmetic and geometric sequences, square, cube, triangular and Fibonacci numbers, digit patterns, and the rules behind growing matchstick and dot patterns.",{"depth":156,"revision":44,"title":913,"subtitle":914,"summary":915,"estimatedMinutes":472,"reviewed":147,"reviewMethod":148},"Pattern detectives: predict, test, explain","Matchstick challenges, Gauss’s trick, calendar magic, growth races and patterns that fool you","Investigate growing patterns like a detective: predict first, collect small cases, find the rule, test it and explain why it works. Includes far predictions, working backwards, odd sums, Gauss’s pairing, grid tricks and always-sometimes-never reasoning.",{"depth":162,"revision":44,"title":917,"subtitle":918,"summary":919,"estimatedMinutes":334,"reviewed":147,"reviewMethod":148},"Why patterns work: rules, algebra and proof","nth terms, equivalent expressions, picture proofs, Pingala’s rhythms, Meru Prastara and patterns that break","Turn rules into algebra and prove them: why the step becomes the coefficient of n, why odd numbers make squares, sums of powers and cubes, the Indian discovery of the Fibonacci numbers and Meru Prastara, why digit patterns stop, and why patterns that look certain can break.",{"depth":168,"revision":44,"title":921,"subtitle":922,"summary":923,"estimatedMinutes":334,"reviewed":147,"reviewMethod":148},"Pattern hunters: puzzles, projects and open questions","Magic squares from Khajuraho, tessellations, figurate numbers, cycles, olympiad problems and unsolved mysteries","Take patterns into the wider world: Lo Shu, Khajuraho and Ramanujan magic squares, tessellations and symmetry, figurate numbers, cycles of last digits and weekdays, the chessboard legend and binary, olympiad problems, patterns in music and careers, projects, and open questions like Collatz.",{"count":925,"sections":233,"levels":926},81,{"foundation":178,"core":927,"stretch":387,"challenge":233},33,{"id":929,"slug":929,"title":930,"question":931,"promise":932,"domains":933,"areas":934,"keywords":935,"status":139,"layers":955,"questionBank":976},"number-system","Number system","How do we read, write and compare really big numbers — and why do Indians and the rest of the world put commas in different places?","Place value, number names, expanded form, predecessors and successors, the Indian and International systems, and rounding — the toolkit for every large number you will ever meet.",[11],[17],[936,937,938,939,940,941,942,943,944,945,946,947,501,948,949,950,951,952,953,954],"place value","number names","expanded form","predecessor","successor","Indian number system","International number system","lakh","crore","million","billion","rounding","comparing numbers","face value","Roman numerals","arab and kharab","Hindu-Arabic numerals","binary","expanded form with powers of ten",[956,960,964,968,972],{"depth":142,"revision":44,"title":957,"subtitle":958,"summary":959,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"Big numbers all around us","Ten digits, a few clever places, and every number you will ever need","Meet place value through bundles of sticks, cricket crowds and rupee notes. Learn to read and write big numbers the Indian way (lakh, crore) and the international way (million, billion), find the number just before and after, compare, round and even read Roman numerals.",{"depth":150,"revision":44,"title":961,"subtitle":962,"summary":963,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"How place value works, and how to use it","Precise rules for names, commas, comparing, forming, rounding and estimating","Exact rules for place and face value, expanded form, number names and both comma systems, with many worked examples. Then reliable methods for converting, comparing, ordering, forming numbers, rounding, estimating and Roman numerals, plus the mix-ups to avoid.",{"depth":156,"revision":44,"title":965,"subtitle":966,"summary":967,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Testing big-number ideas","Predict first, then try it: shifting digits, rollovers, rounding traps and estimation errors","Make predictions about place value and then test them: what moving a digit does, how many numbers of each size exist, when a successor gains a digit, which numbers round to the same value, how far off an estimate can be, and why 6174 keeps appearing.",{"depth":162,"revision":44,"title":969,"subtitle":970,"summary":971,"estimatedMinutes":472,"reviewed":147,"reviewMethod":148},"Why place value works","Powers of ten, proofs of the rules, error bounds and the Indian story of zero","Powers of ten, and proofs that the rules for comparing, rounding and forming numbers always work. Bound estimate errors, meet Sanskrit names for powers of ten, follow our digits from Brahmi to Aryabhata to Baghdad to Europe, and see metric units as place value.",{"depth":168,"revision":44,"title":973,"subtitle":974,"summary":975,"estimatedMinutes":226,"reviewed":147,"reviewMethod":148},"Beyond a billion, and beyond base ten","Arab, kharab and trillion; ISRO distances; binary and other bases; puzzles and projects","Stretch the number system in every direction: bigger names in both systems, real Indian large numbers from elections to Mars, number systems of the Babylonians, Maya and Egyptians, binary as a place-value system, olympiad-style puzzles, Fermi estimates, projects and open questions.",{"count":977,"sections":233,"levels":978},83,{"foundation":235,"core":338,"stretch":176,"challenge":238},{"id":980,"slug":980,"title":981,"question":982,"promise":983,"domains":984,"areas":985,"keywords":986,"status":139,"layers":1006,"questionBank":1027},"order-of-operations","Order of operations","Is 2 + 3 × 4 equal to 20 or 14 — and who decides?","Why we need an agreed order, the DMAS \u002F BODMAS rule, brackets, and how the distributive property explains it all.",[11],[17],[987,988,989,990,991,992,993,994,995,996,997,998,999,1000,1001,1002,500,1003,1004,1005],"DMAS","BODMAS","BIDMAS","PEMDAS","order of operations","brackets","simplify","expression","terms","left to right","precedence","vinculum","of","implied multiplication","four fours","24 game","calculator","distributive property","nested brackets",[1007,1011,1015,1019,1023],{"depth":142,"revision":44,"title":1008,"subtitle":1009,"summary":1010,"estimatedMinutes":338,"reviewed":147,"reviewMethod":148},"One line of maths, one answer","Why 2 + 3 × 4 is 14 everywhere in the world, and the simple rules that make it so","Meet the puzzle 2 + 3 × 4 through a shopping bill, learn why everyone needs one agreed order, and practise the three rules: brackets first, then × and ÷, then + and −, with partners going left to right.",{"depth":150,"revision":44,"title":1012,"subtitle":1013,"summary":1014,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"The rule, precisely","Terms, memory words, three kinds of brackets, “of”, word problems and error-spotting","Make the order of operations precise: split expressions into terms, see why DMAS, BODMAS and PEMDAS all mean one rule, handle nested brackets and \"of\", write expressions from word problems and find mistakes in working.",{"depth":156,"revision":44,"title":1016,"subtitle":1017,"summary":1018,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"Brackets under the microscope","Predict, test and explain: moving brackets, missing signs, calculators and targets","Experiment with the order of operations: count how many values brackets can make, find when brackets change nothing, test always\u002Fsometimes\u002Fnever statements, fill in missing signs, compare calculators and hit targets.",{"depth":162,"revision":44,"title":1020,"subtitle":1021,"summary":1022,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Why the rule is the rule","Repeated addition, the distributive property, powers, the vinculum, history and how machines read maths","Justify the order of operations: why × comes before + (repeated addition, the distributive property), why partners go left to right (negatives and reciprocals), where powers fit, the vinculum and history of brackets, expression trees, RPN and edge cases.",{"depth":168,"revision":44,"title":1024,"subtitle":1025,"summary":1026,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Puzzles, arguments and the wider world","Viral puzzles, four fours, the 24 game, olympiad problems, code and open questions","Take the order of operations further: why 8 ÷ 2(2 + 2) starts arguments, the four fours and 24 puzzles, olympiad problems, how code and spreadsheets differ, other notations, projects and open questions.",{"count":486,"sections":385,"levels":1028},{"foundation":284,"core":636,"stretch":786,"challenge":385},{"id":1030,"slug":1030,"title":1031,"question":1032,"promise":1033,"domains":1034,"areas":1035,"keywords":1036,"status":139,"layers":1053,"questionBank":1074},"phases-of-the-moon","Phases of the Moon","Why does the Moon change shape — and why is it never really a different shape at all?","Half the Moon is always lit. What changes is how much of the lit half faces us. Follow the monthly cycle, learn the names, and find out why the Moon is up in the daytime too.",[63],[69],[1037,1038,1039,1040,1041,1042,1043,1044,1045,1046,551,1047,1048,1049,1050,1051,1052],"moon","phases","new moon","full moon","crescent","gibbous","waxing","waning","lunar month","synodic","tithi","Purnima","Amavasya","terminator","earthshine","far side",[1054,1058,1062,1066,1070],{"depth":142,"revision":44,"title":1055,"subtitle":1056,"summary":1057,"estimatedMinutes":338,"reviewed":147,"reviewMethod":148},"The shape that changes — except it never does","Why the Moon looks different every night, and what is really going on","Meet the Moon's monthly cycle: borrowed sunlight, a ball that is always half lit, and eight named phases. Learn to tell waxing from waning tonight, find out why the Moon is up in the daytime, and kill the biggest myth in astronomy — that the phases are Earth's shadow.",{"depth":150,"revision":44,"title":1059,"subtitle":1060,"summary":1061,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"Reading the Moon: one angle explains everything","Elongation, lit fraction, rise times, the terminator and why one face always faces us","Turn the phase picture into a tool. Learn to go from the Sun-Earth-Moon angle to the shape, the fraction lit and the rise and set times; find out why craters show best at quarter moon, what earthshine is, and why the Moon keeps one face towards Earth.",{"depth":156,"revision":44,"title":1063,"subtitle":1064,"summary":1065,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Put the Moon on trial","Eight investigations, from an orange and a lamp to a month-long diary","Stop reading and start checking. Build a working model of the phases with a ball and a lamp, keep a month-long moon diary, measure the fifty-minute daily lag against your own rooftop, hunt earthshine, and predict a festival moonrise well enough to announce it.",{"depth":162,"revision":44,"title":1067,"subtitle":1068,"summary":1069,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"The chase, the wobble and the brake","Deriving 29.53 days, the elastic tithi, adhik maas, eclipse rarity and the recession, from first principles","Go past the rules to the reasoning: derive the synodic month from two orbital speeds, see why a tithi stretches and shrinks, work out how often adhik maas is needed, derive eclipse rarity from the 5.1-degree tilt, and follow the torque that locked the Moon and is now pushing it away.",{"depth":168,"revision":44,"title":1071,"subtitle":1072,"summary":1073,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"To the wobble, the far side and the far future","Libration, Chandrayaan-3 and the south pole, deep time, other calendars, puzzles and open questions","Push past the settled parts of the topic: measure libration for yourself, trace the far side from Luna 3 to Chandrayaan-3, work out why total eclipses have an expiry date, compare world calendars, and take on puzzles and open questions nobody has fully answered.",{"count":486,"sections":233,"levels":1075},{"foundation":284,"core":387,"stretch":337,"challenge":826},{"id":1077,"slug":1077,"title":1078,"question":1079,"promise":1080,"domains":1081,"areas":1082,"keywords":1083,"status":139,"layers":1102,"questionBank":1123},"prime-and-composite","Prime and composite numbers","Why are some numbers impossible to split into equal groups?","Factors and multiples, prime and composite numbers, the Sieve of Eratosthenes, divisibility tests, twin primes and co-primes.",[11],[21],[1084,1085,1086,1087,1088,609,1089,1090,604,1091,1092,1093,1094,1095,1096,1097,1098,1099,1100,1101],"prime number","composite number","factor","multiple","twin primes","sieve of Eratosthenes","divisibility rules","factor tree","1 is neither","relatively prime","prime triplet","trial division","fundamental theorem of arithmetic","Euclid","Goldbach conjecture","Mersenne prime","perfect number","periodical cicadas",[1103,1107,1111,1115,1119],{"depth":142,"revision":44,"title":1104,"subtitle":1105,"summary":1106,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"Numbers that will not make rectangles","Factors, multiples and the numbers that can only stand in a single line","Share laddoos, set out chairs and build rectangles from tiles to meet factors and multiples. Discover prime numbers, composite numbers, the odd case of 1, the Sieve of Eratosthenes, twin primes and co-primes.",{"depth":150,"revision":44,"title":1108,"subtitle":1109,"summary":1110,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Factors, primes and how to test them","Precise definitions, reliable methods and the mix-ups to avoid","Find every factor with the factor-pair method, sieve to 100 and see why you can stop at 7, test any number for primality by trial division up to its square root, use divisibility rules, and meet twin primes, co-primes and factor trees.",{"depth":156,"revision":44,"title":1112,"subtitle":1113,"summary":1114,"estimatedMinutes":472,"reviewed":147,"reviewMethod":148},"Hunting patterns among the primes","Predict, test and decide: which prime patterns are real, and which ones fool you?","Test claims about primes like a mathematician: how fast primes thin out, the 6-column grid, last digits, twin prime hunts, why 3, 5, 7 stands alone, co-prime experiments, patterns that break, prime deserts and numbers with the most factors.",{"depth":162,"revision":44,"title":1116,"subtitle":1117,"summary":1118,"estimatedMinutes":226,"reviewed":147,"reviewMethod":148},"Why it all works: proofs about primes","Unique factorisation, the square-root rule, the reasons behind divisibility tests, and Euclid’s endless primes","Prove that every number is built from primes in exactly one way, see a world where that fails, count factors from a factorisation, explain the square-root rule and every divisibility test, follow Euclid’s proof that primes never end, and prove facts about co-primes and twin primes.",{"depth":168,"revision":44,"title":1120,"subtitle":1121,"summary":1122,"estimatedMinutes":334,"reviewed":147,"reviewMethod":148},"Primes in the wild: cicadas, codes and unsolved puzzles","From insect life cycles and online banking to record primes, perfect numbers and problems nobody has solved","Take primes into the world: prime cicada cycles, the prime-based codes behind online payments, Mersenne primes and perfect numbers, Goldbach’s and the twin prime conjectures, Indian mathematicians, other number bases, olympiad puzzles and projects.",{"count":173,"sections":233,"levels":1124},{"foundation":235,"core":236,"stretch":176,"challenge":233},{"id":1126,"slug":1126,"title":1127,"question":1128,"promise":1129,"domains":1130,"areas":1131,"keywords":1132,"status":139,"layers":1153,"questionBank":1174},"properties-of-numbers","Properties of numbers","Why does 7 × 8 equal 8 × 7, and how can such rules make mental maths easy?","The closure, commutative, associative and distributive properties, the special roles of 0 and 1, and how they turn hard calculations into easy ones.",[11],[17],[1133,1134,1135,1136,1137,1138,1139,1140,1141,1142,1143,1144,1145,1146,1147,1148,1149,1150,1151,1152],"commutative","associative","distributive","closure","identity","additive identity","multiplicative identity","natural numbers","whole numbers","number line","mental maths","properties of zero","properties of one","division by zero","even and odd","counterexample","always sometimes never","area model","integers","clock arithmetic",[1154,1158,1162,1166,1170],{"depth":142,"revision":44,"title":1155,"subtitle":1156,"summary":1157,"estimatedMinutes":338,"reviewed":147,"reviewMethod":148},"Rules that numbers always follow","Turn-around facts, friendly groups, breaking apart and the magic of 0 and 1","Meet the properties of numbers through chairs, laddoos, kirana bills and socks: why 4 × 6 = 6 × 4, why you can add in any order, how breaking numbers apart makes sums easy, and what 0 and 1 do.",{"depth":150,"revision":44,"title":1159,"subtitle":1160,"summary":1161,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"The properties, precisely","Closure, commutative, associative and distributive laws, and the special numbers 0 and 1","State each property of whole numbers exactly, in words and with letters; see why it holds for + and × but fails for − and ÷; learn why division by zero is undefined; and use the properties for fast, reliable mental maths.",{"depth":156,"revision":44,"title":1163,"subtitle":1164,"summary":1165,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Always, sometimes or never?","Predict, test and explain: counterexamples, grouping gaps, parity patterns and shortcut showdowns","Test claims about whole numbers the way mathematicians do: predict, hunt for counterexamples, measure how badly subtraction and division fail to swap or regroup, discover patterns and shortcuts, and explain why the true ones must be true.",{"depth":162,"revision":44,"title":1167,"subtitle":1168,"summary":1169,"estimatedMinutes":472,"reviewed":147,"reviewMethod":148},"Why the rules must be true","Proofs with arrays and boxes, the distributive law behind every method, zero through history, and the road to algebra","Prove the commutative, associative and distributive laws for every whole number, see why long multiplication and divisibility tests work, show why division by zero would make 0 = 1, prove parity facts with letters, and meet the properties as the rules of algebra.",{"depth":168,"revision":44,"title":1171,"subtitle":1172,"summary":1173,"estimatedMinutes":472,"reviewed":147,"reviewMethod":148},"Properties beyond the whole numbers","Integers, fractions, clocks, computers, puzzles and the problems nobody has solved","Take the properties into new worlds: integers and fractions that repair closure, clock arithmetic, non-commutative everyday actions, rounding inside computers, olympiad puzzles built on parity and the distributive law, projects to try and open questions like Goldbach.",{"count":1175,"sections":385,"levels":1176},85,{"foundation":237,"core":212,"stretch":284,"challenge":174},{"id":1178,"slug":1178,"title":1179,"question":1179,"promise":1180,"domains":1181,"areas":1182,"keywords":1183,"status":139,"layers":1186,"questionBank":1209},"quantum-computing","Quantum Computing","A detailed and thorough understanding of quantum computing",[101],[107],[1184,1185],"quantum","computing",[1187,1192,1196,1200,1204],{"depth":142,"revision":44,"title":1188,"subtitle":1189,"summary":1190,"estimatedMinutes":1191,"reviewed":147,"reviewMethod":806},"The Spinning Coin Machine","How quantum bits break the rules of ordinary computing through superposition and measurement","This lesson introduces quantum computing by comparing classical computer bits to spinning coins, showing how qubits can exist in blended states until measurement forces a definite answer. Learners discover superposition, measurement, and why this new kind of computing matters.",43,{"depth":150,"revision":44,"title":1193,"subtitle":1194,"summary":1195,"estimatedMinutes":160,"reviewed":147,"reviewMethod":806},"The Impossible Coin: How Quantum Computers Think","A plain introduction to qubits, superposition, entanglement, and why measuring changes everything","This lesson explains what makes a quantum computer different from the phone or laptop you use every day, using coins, cricket, and light to make sense of qubits, superposition, entanglement, and measurement. You will learn why quantum computers can solve certain problems faster,",{"depth":156,"revision":44,"title":1197,"subtitle":1198,"summary":1199,"estimatedMinutes":226,"reviewed":147,"reviewMethod":806},"Qubits and Quantum Tricks","How tiny particles let computers solve puzzles ordinary machines cannot touch","This lesson builds quantum computing from the behavior of spinning coins and polarized sunglasses, then lets learners change gates, noise, and qubit counts on paper simulators to predict and test outcomes.",{"depth":162,"revision":44,"title":1201,"subtitle":1202,"summary":1203,"estimatedMinutes":146,"reviewed":147,"reviewMethod":806},"The Qubit and the Quantum Leap","How quantum rules let tiny particles compute in ways ordinary computers cannot","This lesson explores how qubits use superposition and entanglement to process information differently from classical bits, introduces quantum gates and measurement probabilities, and examines which problems quantum computers may solve faster and why building them remains difficul",{"depth":168,"revision":44,"title":1205,"subtitle":1206,"summary":1207,"estimatedMinutes":1208,"reviewed":147,"reviewMethod":806},"The Quantum Advantage: When Small Particles Solve Big Problems","How superposition, entanglement, and quantum gates could change computing forever — and why we aren't there yet.","This lesson explores how quantum computers use qubits that exist in superposition and entanglement to solve certain problems faster than classical computers. Students compare classical and quantum approaches, trace a simple quantum circuit, examine real hardware limits, and desig",41,{"count":1210,"sections":66,"levels":1211},59,{"foundation":178,"core":235,"stretch":826,"challenge":174},{"id":1213,"slug":1213,"title":1214,"question":1214,"promise":1215,"domains":1216,"areas":1217,"keywords":1218,"status":139,"layers":1220,"questionBank":1243},"quantum-networks","Quantum Networks","How quantum networks work. How to build them",[101],[107],[1184,1219],"networks",[1221,1225,1230,1234,1238],{"depth":142,"revision":44,"title":1222,"subtitle":1223,"summary":1224,"estimatedMinutes":177,"reviewed":147,"reviewMethod":806},"The Unhackable Thread","How quantum particles let computers share secrets no spy can steal","This lesson shows how quantum networks use entangled particles and measurement to detect eavesdropping, and how quantum key distribution builds practical secure communication between distant nodes.",{"depth":150,"revision":44,"title":1226,"subtitle":1227,"summary":1228,"estimatedMinutes":1229,"reviewed":147,"reviewMethod":806},"Messages Without Copying: How Quantum Networks Work","Why you cannot copy a quantum signal, and how engineers build the quantum internet anyway","This lesson explains how quantum networks move qubits instead of bits, why the no-cloning theorem stops simple signal boosting, and how entanglement swapping with quantum repeaters solves the distance problem. It separates quantum key distribution from quantum computing networks",51,{"depth":156,"revision":44,"title":1231,"subtitle":1232,"summary":1233,"estimatedMinutes":146,"reviewed":147,"reviewMethod":806},"Blink-Talk: Building Networks from Quantum Dice","How tiny quantum rules let two far-apart machines share secrets no spy can steal","This lesson traces how quantum networks use entanglement and single particles to link computers across cities. Learners change distance, noise and network shape, then test which designs keep quantum signals strong.",{"depth":162,"revision":44,"title":1235,"subtitle":1236,"summary":1237,"estimatedMinutes":212,"reviewed":147,"reviewMethod":806},"The Quantum Post Office","How light carries unbreakable secrets and why quantum networks need a whole new rulebook","This lesson follows a single photon from a laser diode through optical fibre to a distant detector, showing why quantum rules forbid ordinary amplification and how engineers build trust through error rates, entanglement and careful node design.",{"depth":168,"revision":44,"title":1239,"subtitle":1240,"summary":1241,"estimatedMinutes":1242,"reviewed":147,"reviewMethod":806},"Quantum Networks: Building the Unhackable Internet","How photons, entanglement, and quantum repeaters could create networks that keep secrets safe by the laws of physics","This lesson follows the journey of a photon through a quantum network, from sending a secret key across a city to building a nationwide web of entangled links. Readers design protocols, compare architectures, and face the real engineering puzzles that ISRO and labs worldwide are",34,{"count":1244,"sections":66,"levels":1245},61,{"foundation":388,"core":235,"stretch":178,"challenge":174},{"id":1247,"slug":1247,"title":1248,"question":1249,"promise":1250,"domains":1251,"areas":1252,"keywords":1253,"status":139,"layers":1273,"questionBank":1294},"shape-and-space","Shape and space","What makes a square a square, and how many edges does a cube really have?","2D shapes and their properties, 3D solids and their faces, edges and vertices, nets, views from different sides, and symmetry.",[11],[29],[1254,1255,1256,1257,1258,1259,1260,708,1261,1262,1263,1264,1265,1266,1267,1268,1269,1270,1271,1272],"polygon","triangle","quadrilateral","circle","diagonals","cube","cuboid","pyramid","faces edges vertices","net","views","line symmetry","rotational symmetry","Euler","Platonic solids","tangram","tessellation","2D","3D",[1274,1278,1282,1286,1290],{"depth":142,"revision":44,"title":1275,"subtitle":1276,"summary":1277,"estimatedMinutes":338,"reviewed":147,"reviewMethod":148},"Shapes all around us","Flat shapes, solid shapes, and how to count, fold, view and mirror them","Meet 2D and 3D shapes through things you know: carrom boards, dice, laddoos, honeycombs, the Ashoka Chakra and the Taj Mahal. Learn to name polygons, count faces, edges and corners, unfold a box into a net, and find lines of symmetry.",{"depth":150,"revision":44,"title":1279,"subtitle":1280,"summary":1281,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"Naming shapes precisely","Definitions, properties and the mix-ups they clear up","Give every shape an exact definition: polygons and diagonals, triangles by sides and angles, the quadrilateral family tree, the parts of a circle, perimeter, prisms and pyramids, nets, views and line symmetry, with worked examples and common mix-ups.",{"depth":156,"revision":44,"title":1283,"subtitle":1284,"summary":1285,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Test it, fold it, count it","Predictions and experiments with diagonals, triangles, nets, views, symmetry and π","Predict, then test: how fast diagonals multiply, which three sticks make a triangle, what polygon angles add up to, which statements are always true, the F + V − E pattern, which six-square shapes fold into a cube, symmetry in letters, measuring π and which shapes tile a floor.",{"depth":162,"revision":44,"title":1287,"subtitle":1288,"summary":1289,"estimatedMinutes":472,"reviewed":147,"reviewMethod":148},"Why shapes behave as they do","Proofs, edge cases and history: diagonals, angle sums, inequality, Euler and symmetry","Turn patterns into proofs: the diagonal formula, why angles add to 180° and (n − 2) × 180°, the triangle inequality, quadrilateral inheritance, why wheels are round, a sketch proof of Euler’s formula and where it fails, cube-net rules, symmetry orders, and the history of π.",{"depth":168,"revision":44,"title":1291,"subtitle":1292,"summary":1293,"estimatedMinutes":226,"reviewed":147,"reviewMethod":148},"Projects, puzzles and the wider world of shape","Platonic solids, all 11 cube nets, rotational symmetry, tilings, olympiad problems and open questions","Build the five Platonic solids and hunt all 11 cube nets, design rangoli with rotational symmetry, explore tangram paradoxes and semi-regular tilings, count a football, see geometry in Indian monuments and nature, solve olympiad-style problems, and meet questions still unsolved.",{"count":232,"sections":233,"levels":1295},{"foundation":284,"core":636,"stretch":284,"challenge":238},{"id":1297,"slug":1297,"title":52,"question":1298,"promise":1299,"domains":1300,"areas":1301,"keywords":1302,"status":139,"layers":1321,"questionBank":1342},"sound","Why does a drum you cannot touch still reach your ears?","Sound is a vibration travelling through air, water and solids. Learn what makes a sound high or low, loud or soft, why space is silent, and how your ears turn shaking air into music.",[41],[51],[1297,1303,1304,1305,1306,1307,1308,1309,1310,1311,1312,1313,1314,1315,1316,1317,1318,1319,1320],"vibration","wave","pitch","frequency","amplitude","loudness","decibel","echo","medium","ultrasound","hertz","eardrum","resonance","speed of sound","noise","music","sonar","vacuum",[1322,1326,1330,1334,1338],{"depth":142,"revision":44,"title":1323,"subtitle":1324,"summary":1325,"estimatedMinutes":338,"reviewed":147,"reviewMethod":148},"Everything that sounds is shaking","Find the vibration behind every sound, follow it to your ear, and learn why space is silent","Feel your own throat buzz, watch a tuning fork throw water, and follow the shaking from a tabla skin across the room to the hair cells in your ear. Meet pitch, loudness, echoes and the thunder rule, and find out why nothing at all can be heard in space.",{"depth":150,"revision":44,"title":1327,"subtitle":1328,"summary":1329,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"Compressions, rarefactions and the wave equation","What is really travelling, how fast, and how the ear turns it into a signal","See what a sound wave actually is: a train of squashed and stretched air marching outwards. Meet longitudinal waves on a slinky, the equation v = f × λ, why steel beats air by seventeen times, how decibels multiply, and the engineering of the human ear.",{"depth":156,"revision":44,"title":1331,"subtitle":1332,"summary":1333,"estimatedMinutes":212,"reviewed":147,"reviewMethod":148},"Predict it, try it: resonance, echoes and everyday sound technology","Test resonance with a swing and a singing glass, then use echoes the way sonar, ultrasound, bats and dolphins do","Push a swing at the wrong rhythm, make a wine glass sing, and find the sympathetic strings that ring inside a sitar untouched. Time an echo the way sonar and a hospital scanner do, compare a bat's call with a dolphin's, and see why India's noise rules are stricter near a hospital than in a market.",{"depth":162,"revision":44,"title":1335,"subtitle":1336,"summary":1337,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Why resonance, harmonics and reverberation work the way they do","Damping, aeroelastic flutter, singing granite pillars, harmonics and a physicist with 300 cushions","Find out why resonance cannot grow forever, why two famous bridge wobbles had different causes, and why 56 granite pillars at Hampi ring with different notes. Meet Wallace Sabine, who found the reverberation formula with borrowed cushions, and the arithmetic of combining decibels.",{"depth":168,"revision":44,"title":1339,"subtitle":1340,"summary":1341,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Doppler shifts, digital recording and listening to the Earth","The physics of a passing siren, why your recorded voice sounds strange, and how earthquakes get located","Work out how much a siren's pitch shifts as it passes, find out why your recorded voice sounds strange (a real anatomical reason), and see why 44,100 Hz was not an arbitrary choice. Try two projects, solve combined puzzles, and use sound's own reasoning to locate an earthquake.",{"count":687,"sections":233,"levels":1343},{"foundation":388,"core":927,"stretch":337,"challenge":233},{"id":1345,"slug":1345,"title":1346,"question":1346,"promise":1347,"domains":1348,"areas":1349,"keywords":1350,"status":139,"layers":1353,"questionBank":1377},"the-digestive-system","The digestive system","How digestive system work, what are various parts.",[77],[83],[1351,1352],"digestive","system",[1354,1359,1364,1368,1372],{"depth":142,"revision":44,"title":1355,"subtitle":1356,"summary":1357,"estimatedMinutes":734,"reviewed":1358,"reviewMethod":437},"From Bite to Flush: Your Food's Journey","How your body breaks a roti into the tiny packets your cells can use.","This lesson follows food from the first bite to the final exit, meeting each organ that cuts, dissolves and absorbs it. You will learn why digestion is really a long assembly line of physical crushing and chemical dissolving.",false,{"depth":150,"revision":44,"title":1360,"subtitle":1361,"summary":1362,"estimatedMinutes":1363,"reviewed":1358,"reviewMethod":437},"Food's Journey: From Bite to Energy","How your digestive system breaks down every meal into the nutrients that power your body","This lesson follows food from the first bite to the final exit, explaining how each organ mechanically and chemically transforms food into absorbable nutrients. Learners will distinguish digestion from absorption and clear up common misconceptions about which organs do what.",39,{"depth":156,"revision":44,"title":1365,"subtitle":1366,"summary":1367,"estimatedMinutes":1229,"reviewed":1358,"reviewMethod":437},"How Your Body Unpacks a Meal","An engineer's journey through the digestive tract: break, mix, absorb, and adapt","Follow food from bite to bloodstream and discover how each digestive organ changes conditions to speed or slow the work. Use a model gut to test how chewing, enzymes, and diet type shape what your body can extract.",{"depth":162,"revision":44,"title":1369,"subtitle":1370,"summary":1371,"estimatedMinutes":472,"reviewed":1358,"reviewMethod":437},"Journey Through the Gut: How Your Body Turns Food into Fuel","From the first bite to the bloodstream — the mechanics, chemistry, and math of human digestion","Follow a meal through the human digestive tract to see how mechanical churning, enzymes, and acids break food into absorbable nutrients. Learn why villi matter more than you think, and how your body coordinates every step.",{"depth":168,"revision":44,"title":1373,"subtitle":1374,"summary":1375,"estimatedMinutes":1376,"reviewed":1358,"reviewMethod":437},"From Bite to Bloodstream: The Journey of a Meal","How mechanical forces, chemical reactions, and specialised organs transform the food on your plate into fuel for your bo","This lesson follows a complete meal through the human digestive tract, explaining how each organ contributes to mechanical and chemical breakdown, how enzymes speed up reactions, and how lifestyle choices affect this process. It includes a design challenge for testing enzyme acti",47,{"count":824,"sections":66,"levels":1378},{"foundation":826,"core":337,"stretch":787,"challenge":385},{"id":1380,"slug":1380,"title":1381,"question":1381,"promise":1382,"domains":1383,"areas":1384,"keywords":1385,"status":139,"layers":1387,"questionBank":1409},"nervous-system","The Nervous System","All about the nervous system 5 depth's should cover every thing about it",[77],[83],[1386,1352],"nervous",[1388,1392,1396,1400,1404],{"depth":142,"revision":44,"title":1389,"subtitle":1390,"summary":1391,"estimatedMinutes":1363,"reviewed":147,"reviewMethod":806},"Wires of the Body: Your Nervous System","How a drop of hot tea on your hand sparks a lightning-fast rescue mission inside you","This lesson introduces the nervous system as the body's messaging network, tracing how signals travel between sense organs, brain, and muscles. It explains neurons, the central and peripheral systems, and a real reflex arc using everyday Indian examples.",{"depth":150,"revision":44,"title":1393,"subtitle":1394,"summary":1395,"estimatedMinutes":734,"reviewed":147,"reviewMethod":806},"Messages in Microvolts: How Your Body Talks to Itself","From a finger on a hot pan to solving a maths problem—how electricity and chemistry move through living wires inside you","This lesson follows a single signal from skin to brain and back, showing how nerve cells use electricity and chemicals to carry messages. It explains why reflexes skip the brain, why the central and peripheral systems are not separate 'departments', and where common mix-ups occur",{"depth":156,"revision":44,"title":1397,"subtitle":1398,"summary":1399,"estimatedMinutes":166,"reviewed":147,"reviewMethod":806},"Wires of Life: How Your Body Talks to Itself","Build a neuron, race a signal down its cable, and test what makes nerves fire faster or louder","This lesson investigates how nerve cells are built to carry messages, why some signals race while others crawl, and how changing a stimulus changes the response. You will work with real evidence from Indian labs and everyday reflexes.",{"depth":162,"revision":44,"title":1401,"subtitle":1402,"summary":1403,"estimatedMinutes":146,"reviewed":147,"reviewMethod":806},"Wires of the Body: How Your Nervous System Talks","From cricket catches to classroom fright — the science of electrical messages inside you","This lesson follows a nerve signal from skin to muscle, explaining how neurons send all-or-none electrical spikes, how myelin acts like insulation on copper wire, and why your brain and body divide their communication jobs.",{"depth":168,"revision":44,"title":1405,"subtitle":1406,"summary":1407,"estimatedMinutes":1408,"reviewed":147,"reviewMethod":806},"Wired for Speed: How Your Brain Talks to Your Body","Build neuron models, test your own reactions, and debate the future of brain technology","This lesson explores how electrical signals travel through neurons and synapses to control everything from reflexes to conscious decisions. You will build working models, design experiments, and examine how nervous systems adapt across species and after injury.",48,{"count":1210,"sections":66,"levels":1410},{"foundation":178,"core":235,"stretch":826,"challenge":174},{"id":1412,"slug":1412,"title":1413,"question":1413,"promise":1414,"domains":1415,"areas":1416,"keywords":1417,"status":139,"layers":1419,"questionBank":1442},"respiratory-system","The Respiratory System","Should cover extensive details across depths",[77],[83],[1418,1352],"respiratory",[1420,1424,1428,1433,1437],{"depth":142,"revision":44,"title":1421,"subtitle":1422,"summary":1423,"estimatedMinutes":1208,"reviewed":147,"reviewMethod":806},"How We Breathe: The Story of Air and Body","A journey from your first breath to the last, through the machine that never stops","This lesson explains how the human respiratory system moves air in and out, why oxygen matters for every cell, and how your diaphragm and ribs make breathing happen without you thinking. You will meet the parts of this airway highway and test your knowledge with everyday examples",{"depth":150,"revision":44,"title":1425,"subtitle":1426,"summary":1427,"estimatedMinutes":166,"reviewed":147,"reviewMethod":806},"Every Breath You Take: How Your Respiratory System Works","From nose to alveoli — the journey of air, the magic of gas exchange, and why your lungs are built the way they are","This lesson follows the path of air through the respiratory system, explains how oxygen enters the blood and carbon dioxide leaves it, and clears up common mix-ups with the circulatory system. It uses everyday Indian examples and simple models to build genuine understanding.",{"depth":156,"revision":44,"title":1429,"subtitle":1430,"summary":1431,"estimatedMinutes":1432,"reviewed":147,"reviewMethod":806},"Air and Energy: How Your Body Fuels Movement","Modify conditions, measure your own breathing, and test what drives lung volume and airflow","This lesson follows air from nose to alveoli and shows how the diaphragm, ribs, and blood work together to trade oxygen for carbon dioxide. Learners change posture, breathing route, and activity level to predict, compare, and test how gas exchange meets the body's changing fuel n",53,{"depth":162,"revision":44,"title":1434,"subtitle":1435,"summary":1436,"estimatedMinutes":734,"reviewed":147,"reviewMethod":806},"Breathing Deep: How Your Lungs Really Work","From chest movements to gas exchanges in the alveoli — the mechanics, the math, and the why","This lesson traces every breath from nose to blood, explains how muscles and pressure move air, and shows how to calculate what your lungs achieve each minute. It builds from familiar breathing sensations to the invisible gas-exchange membrane and real-life adjustments for exerci",{"depth":168,"revision":44,"title":1438,"subtitle":1439,"summary":1440,"estimatedMinutes":1441,"reviewed":147,"reviewMethod":806},"Breathing Deep: How Lungs Run the Body's Oxygen Bank","An extended journey into respiratory mechanics, gas exchange, environmental adaptations, and the science of lung functio","This lesson explores how the respiratory system harvests oxygen and expels carbon dioxide, from the mechanics of breathing to molecular exchange in alveoli. Learners examine how lungs adapt to exercise, altitude, and water, design experiments to test lung capacity, and trace how",37,{"count":824,"sections":66,"levels":1443},{"foundation":826,"core":337,"stretch":787,"challenge":385},{"id":560,"slug":560,"title":1445,"question":1446,"promise":1447,"domains":1448,"areas":1449,"keywords":1450,"status":139,"layers":1467,"questionBank":1488},"Tides","Why does the sea climb up the beach and slide back, twice a day, forever?","The Moon's pull stretches the ocean into two bulges and Earth turns through them. Learn why there are two high tides a day, why they arrive later each day, and what makes a spring tide.",[63],[73],[1451,1452,1453,1454,1455,1456,1457,541,1458,1459,1460,1461,1462,1463,1464,1465,1466],"tide","high tide","low tide","spring tide","neap tide","tidal range","bulge","Moon","Sun","tidal bore","estuary","tide table","coast","fishing","Chandipur","Hooghly",[1468,1472,1476,1480,1484],{"depth":142,"revision":44,"title":1469,"subtitle":1470,"summary":1471,"estimatedMinutes":338,"reviewed":147,"reviewMethod":148},"Tides: the sea's daily rise and fall","Why the whole ocean leans towards the Moon, twice a day, forever","Meet the tide: not a wave but the whole sea rising and falling. Find out how the Moon's pull makes two bulges, why most coasts get two high tides a day, why the tide is 50 minutes later each day, and what spring and neap tides are.",{"depth":150,"revision":44,"title":1473,"subtitle":1474,"summary":1475,"estimatedMinutes":166,"reviewed":147,"reviewMethod":148},"How the Moon builds two bulges","Difference, not strength: the mechanism behind every tide","Work out why a pull towards the Moon makes a bulge away from it, where 24 h 50 min comes from, why the Sun's tide is only 46% of the Moon's, and why the same Moon gives Kochi one metre and Bhavnagar ten.",{"depth":156,"revision":44,"title":1477,"subtitle":1478,"summary":1479,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Investigate: predicting, classifying and staying safe","Test the ideas from Understand against a real tide table, real coasts and real disasters","Predict and check a day of tide heights, learn to tell semidiurnal, diurnal and mixed tides apart, meet the Hooghly bore and storm surges, see how tidal power and INCOIS's predictions work, and test the funnelling and resonance ideas with real numbers.",{"depth":162,"revision":44,"title":1481,"subtitle":1482,"summary":1483,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Deepen: the mathematics and history behind a tide table","Newton, Laplace, harmonic waves, closed-pipe resonance, and the physics of a bore","Trace the two-hundred-year path from Newton's equilibrium theory to Laplace's ocean waves and Kelvin's tide-predicting machine, meet the harmonic constituents that a real tide is built from, derive why a bay resonates at a quarter wavelength, and quantify Earth's own solid and atmospheric tides.",{"depth":168,"revision":44,"title":1485,"subtitle":1486,"summary":1487,"estimatedMinutes":217,"reviewed":147,"reviewMethod":148},"Extend: deep time, deep space, and open questions","Tidal friction across hundreds of millions of years, tides on other worlds, and what is still unknown","Follow tidal friction from a subtle offset in Earth's bulge to a shorter Cretaceous day, a measurably receding Moon, tidal heating on Io, Europa and Enceladus, and a set of open questions and careers built on this one idea.",{"count":1489,"sections":385,"levels":1490},71,{"foundation":786,"core":283,"stretch":284,"challenge":174},[1492,1495,1497,1500,1502,1504,1506,1508,1510,1512,1514,1516,1519,1522,1524,1526,1528,1530,1532,1534,1536,1538,1540,1542,1544,1546,1548,1550,1552,1554,1556,1558,1560,1562,1564,1566,1568,1570,1572,1574,1576,1578,1580,1582,1584,1586,1588,1590,1592,1594,1596,1598],{"from":929,"to":489,"relation":1493,"reason":1494},"helps_understand","Place value is what makes column addition, carrying and long division work.",{"from":929,"to":287,"relation":1493,"reason":1496},"Reading, comparing and rounding numbers comes first when you sort data and round a mean.",{"from":929,"to":877,"relation":1498,"reason":1499},"related_to","Place-value charts are full of patterns: each place is ten times the one to its right.",{"from":1126,"to":489,"relation":1493,"reason":1501},"Commutative, associative and distributive properties are the shortcuts behind fast, accurate calculation.",{"from":1126,"to":980,"relation":1493,"reason":1503},"The distributive property explains why multiplication is done before addition and how brackets change a result.",{"from":1126,"to":877,"relation":1498,"reason":1505},"Many number patterns — like the sum of consecutive odd numbers — are properties of numbers in disguise.",{"from":489,"to":980,"relation":1493,"reason":1507},"Once each operation is reliable, the next question is which one to do first when several appear together.",{"from":489,"to":1077,"relation":1493,"reason":1509},"Testing whether a number is prime is just careful division: does anything divide it exactly?",{"from":489,"to":287,"relation":1493,"reason":1511},"Finding a mean means adding every value and dividing by how many there are.",{"from":980,"to":877,"relation":1498,"reason":1513},"A pattern rule such as 3 × n + 1 is an expression — you need the order of operations to use it.",{"from":1077,"to":588,"relation":1493,"reason":1515},"Prime factorisation is the fastest route to both the HCF and the LCM.",{"from":1077,"to":877,"relation":1517,"reason":1518},"contrasts_with","Primes famously refuse to follow a simple pattern, unlike even numbers, squares or multiples.",{"from":588,"to":877,"relation":1520,"reason":1521},"applied_in","Two repeating cycles line up again after their LCM — the pattern behind blinking lights and bus timetables.",{"from":588,"to":1247,"relation":1520,"reason":1523},"The largest square tile that fits a rectangular floor exactly has a side equal to the HCF of its length and width.",{"from":877,"to":1247,"relation":1498,"reason":1525},"Growing shape patterns — matchstick squares, dot triangles — are geometry and number at the same time.",{"from":1247,"to":739,"relation":1498,"reason":1527},"Every polygon is built from line segments, and its sides can be parallel or perpendicular.",{"from":1247,"to":180,"relation":1498,"reason":1529},"The corners of shapes are angles: a square has four right angles and a triangle's angles add to 180°.",{"from":739,"to":180,"relation":1493,"reason":1531},"An angle is two rays that share an end point; intersecting lines make angle pairs.",{"from":739,"to":828,"relation":1493,"reason":1533},"Constructions rely on drawing straight lines, perpendiculars and bisectors accurately.",{"from":180,"to":828,"relation":1493,"reason":1535},"Knowing angle types and pairs tells you what you are measuring and checks if your construction is sensible.",{"from":180,"to":287,"relation":1520,"reason":1537},"In a pie chart each slice's angle shows a share of the data: 360° stands for the whole.",{"from":828,"to":1247,"relation":1520,"reason":1539},"Drawing accurate triangles, squares and regular polygons needs measured or constructed angles.",{"from":287,"to":390,"relation":1520,"reason":1541},"A family's monthly electricity use varies; the mean, median and range of a year of bills show what is typical.",{"from":929,"to":390,"relation":1520,"reason":1543},"Power stations are rated in megawatts and India uses lakhs of crores of units a year: reading such numbers needs place value and the Indian system.",{"from":489,"to":390,"relation":1520,"reason":1545},"An electricity bill is units × rate per unit, plus fixed charges, minus subsidies — all four operations in one sheet of paper.",{"from":180,"to":390,"relation":1520,"reason":1547},"A generator's coil turns through 360° every cycle — 50 full turns a second on India's 50 Hz supply.",{"from":1077,"to":390,"relation":1520,"reason":1549},"The encryption that protects smart meters and grid control systems relies on the difficulty of factorising huge numbers into primes.",{"from":690,"to":340,"relation":1493,"reason":1551},"An eclipse is a shadow, and shadows need light that travels in straight lines.",{"from":690,"to":1030,"relation":1493,"reason":1553},"The Moon has no light of its own: we see the half of it the Sun is lighting.",{"from":690,"to":112,"relation":1520,"reason":1555},"The eye is a lens, a screen and a shutter — optics built out of living tissue.",{"from":690,"to":1297,"relation":1517,"reason":1557},"Both travel as waves and carry energy, but light needs no material and races a million times faster than sound.",{"from":1297,"to":112,"relation":1520,"reason":1559},"The ear turns shaking air into signals a nerve can carry: a drum, three tiny bones and a spiral of fluid.",{"from":541,"to":1030,"relation":1493,"reason":1561},"Gravity is what keeps the Moon in the orbit that produces the monthly cycle of phases.",{"from":541,"to":560,"relation":1493,"reason":1563},"Tides are gravity made visible: the Moon pulls the near ocean harder than the far ocean.",{"from":541,"to":340,"relation":1493,"reason":1565},"Eclipses happen only because the Sun, Earth and Moon move on fixed gravitational paths we can predict.",{"from":1030,"to":340,"relation":1493,"reason":1567},"Eclipses can only happen at new moon or full moon — the two phases where the three bodies line up.",{"from":1030,"to":560,"relation":1498,"reason":1569},"Spring and neap tides follow the phases: the biggest tides come at new and full moon.",{"from":112,"to":240,"relation":1493,"reason":1571},"Once you know where each organ sits, you can follow how they pass work to each other.",{"from":240,"to":541,"relation":1498,"reason":1573},"Bones, muscles and blood pressure are all built for a life spent pulling against Earth's gravity — which is why astronauts weaken in orbit.",{"from":439,"to":638,"relation":1493,"reason":1575},"The empires that grew out of the voyages shaped the constitution and the freedoms India wrote for itself afterwards.",{"from":439,"to":560,"relation":1520,"reason":1577},"Sailing ships left harbour on the tide, and monsoon winds and currents set the whole calendar of Indian Ocean trade.",{"from":439,"to":1030,"relation":1520,"reason":1579},"Before clocks and satellites, the Moon and stars were how a navigator knew where they were.",{"from":638,"to":287,"relation":1520,"reason":1581},"A census, an election result and a budget are all data: counted, summarised and argued over.",{"from":638,"to":929,"relation":1520,"reason":1583},"Election results and budgets are read in lakhs and crores — place value with real consequences.",{"from":690,"to":390,"relation":1498,"reason":1585},"A bulb, an LED and a solar panel are all conversions between electricity and light.",{"from":1297,"to":390,"relation":1498,"reason":1587},"Microphones and speakers turn sound into current and current back into sound.",{"from":439,"to":1247,"relation":1520,"reason":1589},"Maps, globes and navigation are geometry: a round Earth flattened onto paper without lying too much.",{"from":340,"to":180,"relation":1520,"reason":1591},"Whether an eclipse is total or partial comes down to angles: the Moon's tilted orbit and the apparent size of two discs.",{"from":560,"to":287,"relation":1520,"reason":1593},"A tide table is a data set: measure the water twice a day for years, and the pattern lets you predict it.",{"from":112,"to":287,"relation":1520,"reason":1595},"Heart rate, height and lung capacity across a class are real data to collect, average and compare.",{"from":541,"to":489,"relation":1520,"reason":1597},"Weight on another world is your mass times that world's gravity — multiplication with an astonishing answer.",{"from":240,"to":287,"relation":1520,"reason":1599},"Pulse and breathing rate before and after exercise are real class data to average, compare and graph.",[],[],[],{"layer":1604,"contentHash":2552,"dependencyHashes":2553,"approval":2554,"releaseId":2557,"sources":2558},{"schemaVersion":44,"conceptId":1178,"locale":1605,"depth":162,"revision":44,"title":1201,"subtitle":1202,"summary":1203,"objectives":1606,"estimatedMinutes":146,"plate":1612,"blocks":1632,"sourceIds":2547,"reviewStatus":2548,"authoring":2549},"en",[1607,1608,1609,1610,1611],"Explain how quantum bits (qubits) differ from classical bits by leveraging superposition and entanglement.","Compare and contrast quantum logic gates with classical logic gates using specific examples.","Calculate probabilities of measurement outcomes for simple two-qubit systems using state vector math.","Evaluate which computational problems quantum algorithms may solve more efficiently and explain why.","Assess current limitations of quantum hardware including decoherence, error rates, and scaling challenges.",{"title":1613,"rows":1614},"Go deeper",[1615,1617,1620,1623,1626,1629],{"label":1616,"value":1613},"Depth",{"label":1618,"value":1619},"Reading time","About 38 minutes",{"label":1621,"value":1622},"Chapters","8",{"label":1624,"value":1625},"Prior knowledge","Classical bits, AND\u002FOR\u002FNOT gates, basic probability, square",{"label":1627,"value":1628},"Activities","Worked probability calculations; gate comparison tables; har",{"label":1630,"value":1631},"Next steps","Quantum algorithms depth; linear algebra fundamentals",[1633,1637,1643,1646,1652,1662,1667,1670,1687,1705,1715,1720,1723,1727,1730,1743,1753,1757,1775,1808,1823,1834,1839,1842,1854,1858,1886,1889,1894,1911,1933,1938,1941,1945,1980,1983,1987,1997,2001,2004,2017,2039,2044,2047,2051,2063,2087,2097,2101,2129,2144,2147,2152,2155,2159,2190,2194,2205,2209,2212,2225,2230,2250,2259,2264,2267,2290,2294,2320,2323,2333,2337,2361,2366,2369,2444,2448,2458,2461,2475,2534,2537],{"id":1634,"type":1635,"markdown":1636},"prose-1","prose","Imagine trying to find one name in a phone book with a billion entries. A classical computer checks each page one by one. But what if you could check all pages at once? This is not magic—it is the promise of quantum computing, where the strange rules governing atoms and electrons become tools for solving puzzles that stump today's most powerful machines.\n\nIn this lesson you will meet the quantum bit or qubit, learn why it can be both 0 and 1 simultaneously through superposition, and discover how entanglement links qubits across space. You will work through real calculations for small quantum circuits, compare quantum and classical logic gates, and finally confront the hard truths: quantum computers are delicate, error-prone, and useful only for specific problems. No prior physics beyond school science is assumed; every new term is defined when it first appears.",{"id":1638,"type":1639,"title":1640,"eyebrow":1641,"navLabel":1642},"chapter-2","chapter","The Phone Book Problem: Why Ordinary Computers Hit Walls","Chapter 01","The search problem",{"id":1644,"type":1635,"markdown":1645},"prose-3","Imagine you have a thick printed phone book with one million names listed alphabetically by name. If I ask you to find Ramesh Sharma's phone number, you flick to the middle, decide R comes after A–M, and keep halving the book. That is a **binary search**, and it takes only about 20 steps even for a million entries because every step splits the problem in half.\n\nBut now imagine I give you a bag with one million numbered tokens, each with a different random four-digit PIN written on it. I say one specific PIN—say 7391—exists on exactly one token inside. You must find it. The tokens are not sorted by PIN. You have no shortcut. You pull out tokens one by one and read them. In the worst case you check all one million tokens.\n\nThis is an **unsorted search**, and it reveals something stubborn about ordinary computers. A classical computer searching an unsorted list of N items may need up to N checks. This is not a quirk of bad programming. It is a structural limit of how classical information works. In this chapter we will see why some everyday problems share this stubbornness, why adding more ordinary computers barely helps, and why that gap created the push for a completely different machine called a quantum computer.",{"id":1647,"type":1648,"variant":1649,"title":1650,"markdown":1651},"callout-4","callout","definition","Classical computer and structural limit","A **classical computer** stores and processes information as definite bits—0 or 1. A **structural limit** is a hard mathematical boundary on how fast any classical computer can solve a problem, no matter how cleverly engineered or how large its budget.",{"id":1653,"type":1654,"title":1655,"problem":1656,"steps":1657},"worked-example-5","worked_example","The lost UPI reference number","Priya is a customer-care worker at a small bank. A customer has lost their 12-digit UPI reference number. The bank's unsorted backup log holds one crore (10 million) reference numbers for that day. Priya's software checks one number per millisecond. How long could the search take in the worst case, and is that practical during a single workday?",[1658,1659,1660,1661],"One crore equals 10 000 000 entries. In the worst case every entry except the last is wrong, so the software may need 10 000 000 checks.","At 1 check per millisecond (0.001 second), total worst-case time = 10 000 000 ms = 10 000 seconds.","Convert to hours: 10 000 ÷ 3 600 ≈ 2.78 hours.","The search could run for nearly three hours before succeeding. If the customer's complaint needs resolution in 30 minutes, the classical search hits a wall—not because the server is old, but because the problem structure demands up to N checks.",{"id":1663,"type":1648,"variant":1664,"title":1665,"markdown":1666},"callout-6","misconception","\"Just buy a faster server\"","It is tempting to think a supercomputer or a room full of servers solves this easily. But unsorted search is not like sorting parcels where ten workers finish ten times faster. Each extra server only carves off a slice of the list. Two servers cut worst-case time to 5 000 seconds; one hundred servers cut it to 100 seconds. To reach 30 minutes you need about six hundred cores working in perfect parallel, just for one lost reference number. The gain is **linear**: you need hardware proportional to the speed-up. For a billion entries, even a thousand servers still face ten lakh checks each. The wall moves; it does not vanish.",{"id":1668,"type":1635,"markdown":1669},"prose-7","The second row in the table deserves a closer look because it touches almost every Indian internet user. When you pay a chaiwala ₹15 through UPI, or when an Aadhaar number is hashed during authentication, **public-key encryption** protects the message. That encryption is built on a mathematical trapdoor: multiplying two large prime numbers is easy, but splitting the product back into its original primes is extraordinarily hard for classical computers.\n\nThe numbers used in practice are 2048 bits long, roughly 600 decimal digits. No classical computer on Earth can factor such a number by brute force before the Sun burns out. This is not because engineers are lazy. The best classical algorithms known—like the **General Number Field Sieve**—still run in time that grows faster than any polynomial as the number gets longer. The security of India's digital payments rests on this structural hardness.",{"id":1671,"type":1672,"tone":1673,"items":1674},"spec-8","spec","blue",[1675,1679,1683],{"label":1676,"big":1677,"value":1678},"RSA-2048 digits","~617","decimal digits in a typical encryption key",{"label":1680,"big":1681,"value":1682},"Age of universe","~13.8 billion","years; still vastly smaller than brute-force factoring time",{"label":1684,"big":1685,"value":1686},"UPI daily volume","~10 crores","transactions per day in India, each protected by this hardness",{"id":1688,"type":1689,"prompt":1690,"options":1691,"explanation":1704},"prediction-9","prediction","A startup claims they have built a special classical chip that checks entries 10 000 times faster. Your unsorted list holds 1 crore items. Roughly how many items must their chip still examine in the worst case before finding the target?",[1692,1695,1698,1701],{"id":1693,"label":1694},"a","About 1 000 items",{"id":1696,"label":1697},"b","About 10 000 items",{"id":1699,"label":1700},"c","About 1 00 000 items",{"id":1702,"label":1703},"d","About 1 00 00 000 items","The speed boost changes time per check, not the structural need to inspect entries. In the worst case the target is last. The chip must still examine up to all 1 crore (10 000 000) items. The correct answer is **d**. Linear speed-ups on classical hardware do not remove the N-check barrier; they only make each check faster. This distinction between engineering speed and structural scaling is exactly why quantum computing attracts attention.",{"id":1706,"type":1707,"title":1708,"points":1709},"summary-10","summary","What this chapter established",[1710,1711,1712,1713,1714],"Classical computers face structural limits, not just slow hardware, on problems like unsorted search and factoring.","Unsorted search needs up to N checks; no classical trick escapes this for guaranteed success.","Factoring large numbers protects UPI and Aadhaar precisely because classical computers scale too poorly to crack it.","Throwing more classical computers at these problems gives only linear improvement, which fails for truly large N.","These limits are mathematical, not temporary. They motivated scientists to ask: what if information itself worked differently?",{"id":1716,"type":1639,"title":1717,"eyebrow":1718,"navLabel":1719},"chapter-11","From Bit to Qubit: Embracing Superposition","Chapter 02","What is a qubit?",{"id":1721,"type":1635,"markdown":1722},"prose-12","Imagine you are watching a cricket match on your phone. Every ball bowled is recorded as either a **dot** (0 runs) or a **boundary** (let us say 1 run, for simplicity). Your phone stores each ball as a bit: a 0 or a 1. This is how all ordinary computers work—every piece of information is built from billions of definite 0s and 1s.\n\nBut inside a quantum computer, the fundamental unit is not a bit. It is a **qubit** (pronounced \"cue-bit\"), short for quantum bit. A qubit can do something that sounds impossible: it can exist in a **superposition** of 0 and 1 at the same time. This does not mean it is \"secretly 0 or secretly 1 and we just do not know.\" It means the qubit is genuinely in a state that is neither 0 nor 1, but something else entirely—something with no everyday equivalent. This chapter explains what that means, why it is not magic, and how we describe it with mathematics.",{"id":1724,"type":1648,"variant":1649,"title":1725,"markdown":1726},"callout-13","Qubit and superposition","A **qubit** is a two-level quantum system that can be in state |0⟩, state |1⟩, or a **superposition** of both.\n\n**Superposition** means the qubit's state is described by a combination α|0⟩ + β|1⟩, where α and β are complex numbers called **amplitudes**. The symbols |0⟩ and |1⟩ are called **basis states** or **computational basis states**—they are the definite 0 and 1 outcomes we can measure.\n\nThe probability of measuring 0 is |α|², and the probability of measuring 1 is |β|². Because probabilities must add to 1, we require |α|² + |β|² = 1. This condition is called **normalisation**.",{"id":1728,"type":1635,"markdown":1729},"prose-14","Let us be careful about what superposition is *not*. A classical coin that is hidden under your hand is either heads or tails—you just do not know which. This is **classical ignorance**, not superposition. A crumpled piece of paper with \"0\" or \"1\" written inside a sealed box is the same: the answer is already fixed, only your knowledge is incomplete.\n\nA qubit in superposition is different. Before measurement, it is not secretly 0 and not secretly 1. It is in a third kind of state, one that can produce **interference effects**—just like light waves from two slits can cancel or reinforce each other. No hidden classical model can explain this. We know this from many experiments, including the famous **double-slit experiment** with single particles, which you may have studied in physics.",{"id":1731,"type":1732,"items":1733},"formulas-15","formulas",[1734,1737,1740],{"expression":1735,"caption":1736},"|ψ⟩ = α|0⟩ + β|1⟩","General single-qubit state (ψ is the Greek letter psi)",{"expression":1738,"caption":1739},"|α|² + |β|² = 1","Normalisation condition: measurement probabilities must sum to 1",{"expression":1741,"caption":1742},"P(0) = |α|²,  P(1) = |β|²","Born rule: probability equals amplitude squared (modulus squared)",{"id":1744,"type":1654,"title":1745,"problem":1746,"steps":1747},"worked-example-16","Computing measurement probabilities","A qubit is in the state |ψ⟩ = (1\u002F√2)|0⟩ + (1\u002F√2)|1⟩. What is the probability of measuring 0? What is the probability of measuring 1? Verify that the state is normalised.",[1748,1749,1750,1751,1752],"Identify the amplitudes: α = 1\u002F√2 and β = 1\u002F√2.","Compute |α|²: (1\u002F√2) × (1\u002F√2) = 1\u002F2. So P(0) = 1\u002F2 or 50%.","Compute |β|²: (1\u002F√2) × (1\u002F√2) = 1\u002F2. So P(1) = 1\u002F2 or 50%.","Check normalisation: |α|² + |β|² = 1\u002F2 + 1\u002F2 = 1. The state is valid.","This particular superposition is called the |+⟩ state. If you measure it, you are equally likely to get 0 or 1.",{"id":1754,"type":1648,"variant":1664,"title":1755,"markdown":1756},"callout-17","\"Superposition means being both 0 and 1 at once\"","This is a popular explanation, but it is misleading. A qubit in superposition is not \"0 AND 1\" in any classical sense. If it were, you could read both values out, and quantum computers would be impossibly powerful.\n\nInstead, think of superposition as a **distinct state with its own properties**. When you measure, you force the qubit to choose between 0 or 1, destroying the superposition. Until then, the qubit behaves according to its amplitudes α and β, including showing interference patterns that no mixture of definite 0s and 1s could produce. The \"spinning coin\" is only a simplified model to help you visualise something that has no true everyday equivalent.",{"id":1758,"type":1672,"tone":1673,"items":1759},"spec-18",[1760,1764,1768,1771],{"label":1761,"big":1762,"value":1763},"Classical bit states","2","Definite 0 or definite 1 only",{"label":1765,"big":1766,"value":1767},"Qubit states (normalised)","∞","Infinite continuum of superpositions on the Bloch sphere surface",{"label":1769,"big":1762,"value":1770},"Measurable outcomes","Still only 0 or 1 when you look",{"label":1772,"big":1773,"value":1774},"Information per qubit","1 bit","Maximum extractable classical information after measurement",{"id":1776,"type":1777,"caption":1778,"columns":1779,"rows":1783},"table-19","table","Classical bit versus qubit: a precise comparison",[1780,1781,1782],"Feature","Classical bit","Qubit",[1784,1788,1792,1796,1800,1804],[1785,1786,1787],"State before measurement","Definitely 0 or definitely 1","Superposition α|0⟩ + β|1⟩",[1789,1790,1791],"Hidden reality","None—you know the state","No hidden value; state is complete description",[1793,1794,1795],"Probabilities","Used for ignorance about many bits","Built into single-qubit physics",[1797,1798,1799],"Can interfere?","No","Yes—amplitudes can add or cancel",[1801,1802,1803],"Copy freely?","Yes","No—quantum no-cloning theorem",[1805,1806,1807],"Visual model","Coin on table (heads or tails)","Coin spinning in air (simplified model only)",{"id":1809,"type":1810,"itemId":1811,"prompt":1812,"check":1813,"hints":1815,"feedback":1820},"practice-20","practice","quantum-computing.p001","A qubit is in the state |ψ⟩ = (3\u002F5)|0⟩ + (4\u002F5)|1⟩. What is the probability of measuring 1? (Give your answer as a fraction or decimal.)",{"kind":1814,"numerator":388,"denominator":283,"acceptEquivalent":147},"fraction",[1816,1817,1818,1819],"Identify the amplitude β for the |1⟩ component: it is 4\u002F5.","The probability is |β|², which means β multiplied by itself (since 4\u002F5 is a real number).","Compute (4\u002F5) × (4\u002F5).","Check: the probability for |0⟩ would be (3\u002F5)² = 9\u002F25. Does 9\u002F25 + your answer equal 1?",{"correct":1821,"incorrect":1822},"Correct! |4\u002F5|² = 16\u002F25 = 0.64. There is a 64% chance of measuring 1. Notice that 9\u002F25 + 16\u002F25 = 25\u002F25 = 1, so normalisation is satisfied.","Careful. The amplitude for |1⟩ is β = 4\u002F5. The probability is |β|² = (4\u002F5)² = 16\u002F25. Remember to square the amplitude, not just read it off.",{"id":1824,"type":1707,"title":1825,"points":1826},"summary-21","What we built in this chapter",[1827,1828,1829,1830,1831,1832,1833],"A qubit is a two-level quantum system whose state is a superposition α|0⟩ + β|1⟩.","Amplitudes α and β are complex numbers; measurement probabilities are |α|² and |β|².","The normalisation condition |α|² + |β|² = 1 ensures probabilities sum to 1.","Superposition is not classical ignorance—it is a distinct quantum state with no hidden value.","A spinning coin is a simplified model, not a true analog; the Bloch sphere gives the full picture.","When measured, a qubit collapses to |0⟩ or |1⟩; before measurement, it can show interference.","Next, we explore what happens when two qubits become linked in a way no classical system can replicate.",{"id":1835,"type":1639,"title":1836,"eyebrow":1837,"navLabel":1838},"chapter-22","Entanglement: The Einstein-Podolsky-Rosen Connection","Chapter 03","Spooky action",{"id":1840,"type":1635,"markdown":1841},"prose-23","Imagine two friends, Ananya in Bengaluru and Vikram in Chennai, each holding one half of a magic coin. When Ananya flips hers and sees Heads, she instantly knows Vikram's coin will show Heads too. When she sees Tails, Vikram's is always Tails. They can repeat this a thousand times — always matching, never random. But here's the strange part: neither coin shows a definite result until flipped, and no text message travels between the cities. This is not a trick; it is **entanglement**, one of the most powerful and most misunderstood ideas in quantum computing.\n\nIn Chapter 2, you met the qubit living in **superposition** — a blend of |0⟩ and |1⟩. Now we put two qubits together and ask: can their shared state be described by simply listing each qubit's individual condition? For most quantum states, the answer is no. When the whole system knows something that neither part knows alone, we call the qubits **entangled**. Entanglement is not just \"two things being related.\" It is a specific, mathematically precise property of quantum states that has no analogue in ordinary experience. It lets quantum computers explore vast solution spaces, enables quantum teleportation, and once made Albert Einstein so uncomfortable that he helped invent it — only to argue against its completeness for decades.",{"id":1843,"type":1654,"title":1844,"problem":1845,"steps":1846},"worked-example-24","Testing the Bell state for entanglement","Show that the two-qubit state (|00⟩ + |11⟩)\u002F√2 cannot be written as the product of two single-qubit states. A general product state would look like (a|0⟩ + b|1⟩) ⊗ (c|0⟩ + d|1⟩), where |a|^2 + |b|^2 = 1 and |c|^2 + |d|^2 = 1.",[1847,1848,1849,1850,1851,1852,1853],"Expand the product state: (a|0⟩ + b|1⟩) ⊗ (c|0⟩ + d|1⟩) = ac|00⟩ + ad|01⟩ + bc|10⟩ + bd|11⟩.","Compare with our target state (|00⟩ + |11⟩)\u002F√2. This has coefficient 1\u002F√2 for |00⟩, zero for |01⟩, zero for |10⟩, and 1\u002F√2 for |11⟩.","Match coefficients: ac = 1\u002F√2, ad = 0, bc = 0, bd = 1\u002F√2.","From ad = 0, either a = 0 or d = 0. But ac = 1\u002F√2 means a ≠ 0. So d = 0.","From bc = 0, either b = 0 or c = 0. But ac = 1\u002F√2 means c ≠ 0. So b = 0.","If d = 0 and b = 0, then bd = 0. But we need bd = 1\u002F√2. Contradiction.","Therefore no such a, b, c, d exist. The state is entangled — it genuinely describes the pair, not two individuals.",{"id":1855,"type":1648,"variant":1664,"title":1856,"markdown":1857},"callout-25","No faster-than-light messaging","A common belief: since measuring one entangled qubit instantly determines the other, you could send signals faster than light, even backward in time. This is wrong. The **correlation** is real, but **causation** is absent. Here's why: each qubit, measured alone, shows a perfectly random 50-50 outcome. Only when Ananya and Vikram later meet (or send ordinary classical messages) and compare notebooks do they see the match. The entanglement alone produces no locally detectable pattern. No information travels; only the *comparison* reveals the correlation. Einstein's relativity remains safe.",{"id":1859,"type":1777,"caption":1860,"columns":1861,"rows":1865},"table-26","Classical correlation vs. quantum entanglement",[1862,1863,1864],"Property","Classical matching coins","Quantum entangled qubits",[1866,1869,1873,1877,1879,1882],[1785,1867,1868],"Hidden definite result (HL or HT, etc.)","No definite result; shared superposition",[1870,1871,1872],"Measurement outcome locally","Random but pre-determined","Truly random, Born rule probabilities",[1874,1875,1876],"Correlation revealed","Immediately obvious if you trust the source","Only visible after classical comparison",[1878,1798,1798],"Can send information FTL?",[1880,1798,1881],"Violates Bell inequalities?","Yes, experimentally confirmed",[1883,1884,1885],"Computing power","None extra","Enables exponential state-space exploration",{"id":1887,"type":1635,"markdown":1888},"prose-27","Entanglement's computational power comes from how it enlarges the playground. Two classical bits can represent exactly one of four states: 00, 01, 10, or 11. Two qubits can occupy any point in a four-dimensional **Hilbert space**, including superpositions and entangled combinations. For n qubits, the state space has dimension 2^n — exponential growth. Entanglement is the glue that lets quantum gates act on this entire space at once. A classical AND gate takes two bits and returns a definite bit. A quantum gate like the **CNOT** (controlled-NOT) flips the second qubit conditional on the first — but when the control is in superposition, the output can be entangled, carrying information about both possibilities simultaneously. This is why quantum algorithms like Shor's factoring and Grover's search achieve speedups impossible classically: entanglement lets the computation explore many paths together, and interference (from superposition) brings the right answer forward.\n\nQuantum teleportation offers a dramatic demonstration. Suppose Ananya has an unknown qubit state she wants to send Vikram. She cannot clone it (the **no-cloning theorem** prevents copying arbitrary quantum states). Instead, she and Vikram share an entangled pair. Ananya performs a measurement on her unknown qubit and her half of the entangled pair, obtaining two classical bits. She texts these bits to Vikram — ordinary, light-speed-limited communication. Vikram applies simple operations based on her message, and his qubit becomes exactly Ananya's original state. The state has 'jumped' without passing through space, but critically, it needed both entanglement *and* classical communication. Neither alone suffices.",{"id":1890,"type":1648,"variant":1891,"title":1892,"markdown":1893},"callout-28","nuance","Entanglement is necessary but not sufficient","Not every quantum speedup requires entanglement, and entanglement alone does not guarantee speedup. Some quantum protocols use only superposition. Conversely, highly entangled states can be useless if the algorithm does not exploit them. For computing, what matters is the **right kind** of entanglement spread across qubits in a way that the algorithm's interference pattern can extract a useful answer. This is still an active research area — Google Quantum AI and IBM both study how to generate and verify 'useful' versus 'noisy' entanglement in their processors.",{"id":1895,"type":1689,"prompt":1896,"options":1897,"explanation":1910},"prediction-29","Ananya and Vikram share the Bell state (|00⟩ + |11⟩)\u002F√2. Ananya measures her qubit and gets 0. What is the state of Vikram's qubit immediately after her measurement, before he measures?",[1898,1901,1904,1907],{"id":1899,"label":1900},"super","Still in superposition, could be 0 or 1",{"id":1902,"label":1903},"zero","Definitely |0⟩",{"id":1905,"label":1906},"one","Definitely |1⟩",{"id":1908,"label":1909},"unknown","Cannot be determined without more information","The correct answer is 'Definitely |0⟩'. The Bell state is a single, shared quantum state. When Ananya measures 0, the entire state collapses from (|00⟩ + |11⟩)\u002F√2 to |00⟩. This means Vikram's qubit is instantaneously in state |0⟩ — not because a signal traveled, but because the joint possibility |11⟩ has been eliminated. This is the 'spooky' aspect Einstein disliked, but it is rigorously predicted by quantum mechanics and confirmed in experiments.",{"id":1912,"type":1913,"title":1914,"terms":1915},"glossary-30","glossary","Terms from this chapter",[1916,1920,1923,1926,1929],{"term":1917,"meaning":1918,"example":1919},"Bell state","One of four maximally entangled two-qubit states; the simplest entanglement example.","(|00⟩ + |11⟩)\u002F√2 is the Bell state |Φ+⟩.",{"term":1921,"meaning":1922},"Separable state","A multi-qubit state that can be written as a product of individual qubit states.",{"term":1924,"meaning":1925},"No-cloning theorem","It is impossible to create an identical independent copy of an arbitrary unknown quantum state.",{"term":1927,"meaning":1928},"No-signalling","The principle that entanglement cannot be used to transmit information faster than light.",{"term":1930,"meaning":1931,"example":1932},"Quantum teleportation","Transfer of a quantum state from one location to another using entanglement plus classical communication.","ISRO's quantum communication experiments test protocols like this.",{"id":1934,"type":1639,"title":1935,"eyebrow":1936,"navLabel":1937},"chapter-31","Quantum Logic Gates: Building the Circuit","Chapter 04","Quantum gates",{"id":1939,"type":1635,"markdown":1940},"prose-32","Imagine you are building a railway switching yard. A classical signal box uses simple levers: a train either goes left or right, track A or track B. But a quantum signal box is stranger. The train can exist in a blend of both paths at once, and every switch must remember how to undo itself—no information can ever be lost. These switches are called quantum logic gates, and they are the building blocks of every quantum circuit, from the algorithms that run on IBM's quantum processors to the simulations ISRO scientists might one day use for satellite trajectory optimization.\n\nIn a classical computer, logic gates like AND, OR, and NOT process definite 0s and 1s. An AND gate outputs 1 only if both inputs are 1; otherwise it outputs 0. Once the gate fires, the original inputs are gone—you cannot recover them from the output alone. This destruction of information is so commonplace that we rarely notice it. But quantum mechanics forbids such irreversible acts. Every quantum gate must be a perfect, undo-able rotation in an abstract space called Hilbert space. This single constraint—unitary evolution—shapes every gate we can build.",{"id":1942,"type":1648,"variant":1649,"title":1943,"markdown":1944},"callout-33","Unitary Matrix and Reversibility","A **unitary matrix** U is a square matrix whose inverse equals its conjugate transpose: U†U = I, where I is the identity matrix and † (dagger) means transpose and complex-conjugate every entry. This guarantees that the gate is **reversible**: applying U† after U returns the original state exactly. It also preserves the total probability (the sum of squared magnitudes of amplitudes stays 1).",{"id":1946,"type":1777,"caption":1947,"columns":1948,"rows":1951},"table-34","Classical vs. Quantum Gates: Structural Differences",[1780,1949,1950],"Classical (e.g., AND, OR)","Quantum (any valid gate)",[1952,1956,1960,1964,1968,1972,1976],[1953,1954,1955],"Input states","Definite 0 or 1","Superpositions: a|0⟩ + b|1⟩",[1957,1958,1959],"Output states","Single definite bit","New superposition: a'|0⟩ + b'|1⟩",[1961,1962,1963],"Reversibility","Irreversible (AND loses input info)","Must be reversible (unitary)",[1965,1966,1967],"Number of inputs vs. outputs","Can reduce bits (2→1)","Must equal: n qubits → n qubits",[1969,1970,1971],"Matrix size","Not usefully represented","2^n × 2^n unitary matrix",[1973,1974,1975],"Universal gate example","NAND alone is universal","H + CNOT + T is universal",[1977,1978,1979],"Physical analog","Relay switch","Precise microwave pulse or laser",{"id":1981,"type":1635,"markdown":1982},"prose-35","Let us meet three workhorse gates. The Pauli-X gate is the quantum cousin of classical NOT. It flips |0⟩ to |1⟩ and |1⟩ to |0⟩. Its matrix is the familiar 2×2 [[0, 1], [1, 0]], the same matrix that swaps the basis states. Unlike classical NOT, however, Pauli-X must also handle superpositions: applied to (|0⟩ + |1⟩)\u002F√2, it simply swaps the amplitudes, yielding the same state because the amplitudes were equal. This is reversibility in action—apply X twice and you return exactly where you started.\n\nThe Hadamard gate, named after the French mathematician Jacques Hadamard, has no classical equivalent. Its matrix is [[1\u002F√2, 1\u002F√2], [1\u002F√2, -1\u002F√2]]. When it acts on |0⟩, it produces (|0⟩ + |1⟩)\u002F√2, an equal superposition. Acting on |1⟩, it produces (|0⟩ - |1⟩)\u002F√2, a superposition with a relative negative sign. This minus sign is not mere decoration; it creates interference patterns that quantum algorithms exploit. The Hadamard is the gate that lets a quantum computer explore multiple paths simultaneously.",{"id":1984,"type":1648,"variant":1891,"title":1985,"markdown":1986},"callout-36","Why No Quantum AND Gate Exists","You cannot build a quantum AND gate that takes two qubits and outputs one qubit. Such a gate would map four input combinations (|00⟩, |01⟩, |10⟩, |11⟩) to two output states, throwing away information. This violates reversibility. Classical computers solve this by accepting irreversibility and generating heat; quantum computers cannot. Instead, quantum designers use **Toffoli gates** (controlled-controlled-NOT), which use a third 'ancilla' qubit to store the AND result while keeping all inputs recoverable. The ancilla trick is universal: any irreversible classical computation can be embedded inside a reversible quantum circuit at the cost of extra qubits.",{"id":1988,"type":1654,"title":1989,"problem":1990,"steps":1991},"worked-example-37","Creating Entanglement with Hadamard and CNOT","Start with two qubits in state |00⟩. Apply a Hadamard gate to qubit 0 (the control), then apply a CNOT with qubit 0 as control and qubit 1 as target. What is the final two-qubit state? Why is this state special?",[1992,1993,1994,1995,1996],"Step 1: Write the initial state as a tensor product |0⟩⊗|0⟩ = |00⟩.","Step 2: Apply H to qubit 0. The identity gate I acts on qubit 1. The combined operation is H⊗I. The state becomes (H|0⟩)⊗|0⟩ = ((|0⟩+|1⟩)\u002F√2)⊗|0⟩ = (|00⟩ + |10⟩)\u002F√2.","Step 3: Apply CNOT. The CNOT rule is: |00⟩→|00⟩, |01⟩→|01⟩, |10⟩→|11⟩, |11⟩→|10⟩. Only |10⟩ flips its second bit.","Step 4: CNOT transforms (|00⟩ + |10⟩)\u002F√2 into (|00⟩ + |11⟩)\u002F√2.","Step 5: This is the Bell state |Φ+⟩, a maximally entangled state. Measuring qubit 0 instantly forces qubit 1 to match: both 0 or both 1, each with 50% probability. The qubits have no individual definite state—only a joint state exists.",{"id":1998,"type":1648,"variant":1664,"title":1999,"markdown":2000},"callout-38","CNOT Does Not Clone","Many students think CNOT copies the control qubit onto the target. If this were true, input |+0⟩ where |+⟩ = (|0⟩+|1⟩)\u002F√2 would output |++⟩, giving two independent copies of |+⟩. But CNOT outputs (|00⟩+|11⟩)\u002F√2, an entangled state. The **no-cloning theorem** rigorously proves that an arbitrary quantum state cannot be copied perfectly. CNOT copies only the computational basis states |0⟩ and |1⟩, not superpositions. This is why quantum error correction is far harder than classical: you cannot simply duplicate fragile quantum information.",{"id":2002,"type":1635,"markdown":2003},"prose-39","The CNOT gate is a two-qubit gate, represented by a 4×4 matrix because two qubits have four basis states: |00⟩, |01⟩, |10⟩, |11⟩. Its matrix has 1s on the diagonal for |00⟩ and |01⟩, but swaps the |10⟩ and |11⟩ rows—this is the 'flip target if control is 1' rule embedded in matrix form. No single-qubit gate can create entanglement; CNOT is essential because it spreads correlations across qubits. Together with single-qubit rotations, CNOT forms a powerful universal set, though the rigorous universal set Hadamard + CNOT + T gate adds the precise phase control needed for arbitrary single-qubit gates via the Solovay-Kitaev theorem.",{"id":2005,"type":1689,"prompt":2006,"options":2007,"explanation":2016},"prediction-40","You apply a Hadamard gate to |0⟩, giving (|0⟩+|1⟩)\u002F√2. Then you apply a second Hadamard gate. What is the final state?",[2008,2010,2012,2014],{"id":1693,"label":2009},"|1⟩",{"id":1696,"label":2011},"|0⟩",{"id":1699,"label":2013},"(|0⟩+|1⟩)\u002F√2 again",{"id":1702,"label":2015},"(|0⟩-|1⟩)\u002F√2","The correct answer is |0⟩ (option b). The Hadamard gate is its own inverse: H² = I, the identity. Apply H to (|0⟩+|1⟩)\u002F√2 and the amplitudes interfere constructively back to |0⟩ and destructively to cancel |1⟩. This is the quantum flip-flop: H undoes itself, a direct consequence of unitarity. The minus sign in H's lower-right entry ensures the second application restores the original, not a different state.",{"id":2018,"type":1672,"tone":1673,"items":2019},"spec-41",[2020,2024,2027,2031,2035],{"label":2021,"big":2022,"value":2023},"Pauli-X matrix","2×2","Unitary, Hermitian, squares to identity: X² = I",{"label":2025,"big":2022,"value":2026},"Hadamard matrix","Unitary, Hermitian, H² = I; creates equal superpositions",{"label":2028,"big":2029,"value":2030},"CNOT matrix","4×4","Unitary; entangles, does not clone; essential for universal QC",{"label":2032,"big":2033,"value":2034},"Universal set","H+CNOT+T","Can approximate any unitary to arbitrary precision",{"label":2036,"big":2037,"value":2038},"Basis states","2^n","For n qubits; matrix dimension is 2^n × 2^n",{"id":2040,"type":1639,"title":2041,"eyebrow":2042,"navLabel":2043},"chapter-42","Calculating Outcomes: State Vectors for Two Qubits","Chapter 05","Doing the math",{"id":2045,"type":1635,"markdown":2046},"prose-43","Imagine you have two coins that can exist in a mysterious blended state, not just heads or tails. In the previous chapters, we saw that a single qubit can be in superposition, like a coin spinning in the air. Now we put two qubits together. The result is not just two separate spins — it is a single, four-dimensional description that captures all possible combinations.\n\nThis chapter teaches you how to calculate what happens when quantum gates act on two qubits. We will use nothing harder than multiplication and squaring. By the end, you will be able to predict the exact chance of each outcome when you measure a two-qubit system — including the famous Bell state, which even Einstein found puzzling.",{"id":2048,"type":1648,"variant":1649,"title":2049,"markdown":2050},"callout-44","State vector for two qubits","A **state vector** is a list of numbers (amplitudes) that completely describes a quantum system. For two qubits, there are four possible measurement outcomes: |00⟩, |01⟩, |10⟩, and |11⟩. The state vector is a column of four amplitudes, one for each outcome. We write it as:\n\n|ψ⟩ = a|00⟩ + b|01⟩ + c|10⟩ + d|11⟩\n\nThe **amplitude** of each basis state is a complex number. For our examples, all amplitudes will be real numbers like 1\u002F√2 to keep arithmetic simple. The **probability** of measuring a particular outcome equals the amplitude squared: |a|², |b|², |c|², or |d|². Because probabilities must add to 1, the state vector must be **normalised**: |a|² + |b|² + |c|² + |d|² = 1.",{"id":2052,"type":1732,"items":2053},"formulas-45",[2054,2057,2060],{"expression":2055,"caption":2056},"|00⟩ = [1, 0, 0, 0]^T","Column vector for both qubits in state 0",{"expression":2058,"caption":2059},"|ψ_final⟩ = U × |ψ_initial⟩","Applying a gate U means matrix multiplication",{"expression":2061,"caption":2062},"P(outcome) = |amplitude|²","Probability from amplitude, never from amplitude directly",{"id":2064,"type":2065,"title":2066,"items":2067},"steps-46","steps","How to evolve a two-qubit state",[2068,2072,2075,2079,2083],{"title":2069,"tag":2070,"text":2071},"Write the initial state","setup","Express |ψ⟩ as a four-entry column vector. |00⟩ is [1, 0, 0, 0], |01⟩ is [0, 1, 0, 0], and so on.",{"title":2073,"tag":2070,"text":2074},"Represent the gate as a matrix","A two-qubit gate is a 4×4 matrix. Single-qubit gates like H become 4×4 when we specify which qubit they act on.",{"title":2076,"tag":2077,"text":2078},"Multiply matrix by vector","calculate","Perform matrix multiplication: each new amplitude is the sum of products across a row.",{"title":2080,"tag":2081,"text":2082},"Check normalisation","verify","Add the squares of all four new amplitudes. The total must equal 1.",{"title":2084,"tag":2085,"text":2086},"Read probabilities","result","Square each amplitude to get the probability of measuring |00⟩, |01⟩, |10⟩, or |11⟩.",{"id":2088,"type":1654,"title":2089,"problem":2090,"steps":2091},"worked-example-47","Creating a Bell state: H then CNOT","Start with two qubits in state |00⟩. Apply a Hadamard gate H to qubit 1 (the first qubit), then apply a CNOT gate with qubit 1 as control and qubit 2 as target. What are the measurement probabilities?",[2092,2093,2094,2095,2096],"The initial state vector is |00⟩ = [1, 0, 0, 0]. These four entries correspond to |00⟩, |01⟩, |10⟩, |11⟩ in that order.","First, apply H to qubit 1. When H acts on one qubit, it transforms |0⟩ to (|0⟩ + |1⟩)\u002F√2. Acting on qubit 1 in |00⟩ gives (|00⟩ + |10⟩)\u002F√2. As a vector: [1\u002F√2, 0, 1\u002F√2, 0]. Check: (1\u002F√2)² + 0² + (1\u002F√2)² + 0² = 1\u002F2 + 0 + 1\u002F2 + 0 = 1. Good.","Now apply CNOT. This gate flips the target qubit (qubit 2) when the control qubit (qubit 1) is |1⟩. In our current state, |00⟩ stays |00⟩ and |10⟩ becomes |11⟩. The new state is (|00⟩ + |11⟩)\u002F√2. As a vector: [1\u002F√2, 0, 0, 1\u002F√2].","Check normalisation again: (1\u002F√2)² + 0² + 0² + (1\u002F√2)² = 1\u002F2 + 0 + 0 + 1\u002F2 = 1.","Read off probabilities: P(|00⟩) = |1\u002F√2|² = 1\u002F2 = 50%, P(|01⟩) = 0%, P(|10⟩) = 0%, P(|11⟩) = 50%. This is the Bell state — measuring one qubit instantly tells you the other, even though neither had a definite value before measurement.",{"id":2098,"type":1648,"variant":1664,"title":2099,"markdown":2100},"callout-48","Squaring before adding versus adding before squaring","A very common mix-up: some learners square each amplitude first, then add those probabilities together as if the amplitudes were separate. This destroys **interference**.\n\nThe correct order is: add the amplitudes first (they can be positive or negative), then square the result to get probability. If two paths to the same outcome have amplitudes +1\u002F√2 and −1\u002F√2, they cancel out: (1\u002F√2) + (−1\u002F√2) = 0, so the probability is 0² = 0. If you squared first, you would incorrectly get (1\u002F2) + (1\u002F2) = 1.\n\nBetween measurements, nature keeps track of amplitudes, not probabilities. Probabilities only appear at the final step.",{"id":2102,"type":1777,"caption":2103,"columns":2104,"rows":2109},"table-49","Common two-qubit states and their probability distributions",[2105,2106,2107,2108],"State name","State vector [a, b, c, d]","P(|00⟩)","P(|11⟩)",[2110,2115,2118,2122,2125],[2111,2112,2113,2114],"|00⟩ (computational)","[1, 0, 0, 0]","100%","0%",[2116,2117,2114,2113],"|11⟩ (computational)","[0, 0, 0, 1]",[2119,2120,2121,2121],"Bell state Φ+","[1\u002F√2, 0, 0, 1\u002F√2]","50%",[2123,2124,2121,2121],"Bell state Φ−","[1\u002F√2, 0, 0, −1\u002F√2]",[2126,2127,2128,2128],"Uniform superposition","[1\u002F2, 1\u002F2, 1\u002F2, 1\u002F2]","25%",{"id":2130,"type":1810,"itemId":2131,"prompt":2132,"check":2133,"hints":2137,"feedback":2141},"practice-50","quantum-computing.p002","A two-qubit system starts in |00⟩. You apply a gate that transforms it to the state [1\u002F2, 1\u002F2, 1\u002F2, 1\u002F2]. Verify this state is normalised, then calculate the probability of measuring |01⟩.",{"kind":2134,"answer":283,"tolerance":2135,"unit":2136},"number",0.1,"%",[2138,2139,2140],"Square each of the four amplitudes: (1\u002F2)², (1\u002F2)², (1\u002F2)², (1\u002F2)².","Add them: four copies of 1\u002F4 gives 1. So it is normalised.","The amplitude for |01⟩ is the second entry: 1\u002F2. Square it: (1\u002F2)² = 1\u002F4 = 25%.",{"correct":2142,"incorrect":2143},"Correct! Each amplitude is 1\u002F2, so each probability is 1\u002F4 = 25%. There are four equally likely outcomes.","Remember: probability is amplitude squared, not amplitude itself. (1\u002F2)² = 1\u002F4, which is 25%.",{"id":2145,"type":697,"prompt":2146},"reflection-51","Think about the Bell state [1\u002F√2, 0, 0, 1\u002F√2]. Why is it impossible to write this as two separate single-qubit states? What does this tell you about the power — and the strangeness — of entanglement?",{"id":2148,"type":1639,"title":2149,"eyebrow":2150,"navLabel":2151},"chapter-52","Algorithms That Win: Where Quantum Speeds Up","Chapter 06","Quantum advantage",{"id":2153,"type":1635,"markdown":2154},"prose-53","Imagine you have a dusty register book at a railway station with one million passenger names written in no particular order. To find \"Ramesh Kumar,\" a clerk must check entries one by one. On average, this takes checking half the book—about 500,000 names. This is how ordinary computers search too: check, move on, check again. But in 1996, Lov Grover discovered that a quantum computer could find Ramesh in roughly 1,000 steps instead of 500,000. That is not a small improvement; it is a square-root speedup. Grover's algorithm is one of several quantum methods that beat classical computers, but only for specific problems. This chapter shows where quantum machines actually win, how the speedup works, and why we must be careful not to imagine them as magical all-purpose solvers.\n\nThe key idea is **quantum advantage**: a quantum computer completes a useful task faster, cheaper, or with better quality than any classical method could in reasonable time. The advantage is always **problem-specific**. Some tasks see dramatic gains; many see none at all.",{"id":2156,"type":1648,"variant":1649,"title":2157,"markdown":2158},"callout-54","Quadratic versus exponential speedup","**Quadratic speedup** means the quantum running time scales as the square root of the classical time: if the classical need is N steps, quantum needs about √N. **Exponential speedup** means the quantum time grows as a polynomial like n^3 while classical time grows as 2^n, making the gap explode as problem size increases.",{"id":2160,"type":1777,"caption":2161,"columns":2162,"rows":2169},"table-55","Three major quantum algorithms and their speedups",[2163,2164,2165,2166,2167,2168],"Algorithm","Problem it solves","Classical cost (roughly)","Quantum cost (roughly)","Type of speedup","Real-world impact",[2170,2177,2184],[2171,2172,2173,2174,2175,2176],"Grover's search","Find one item in unsorted list of N items","N\u002F2 checks on average","√N steps","Quadratic","Database search, optimization shortcuts",[2178,2179,2180,2181,2182,2183],"Shor's algorithm","Factor an n-digit integer into primes","Sub-exponential: roughly 2^(n^(1\u002F3)) (best known)","Polynomial: roughly n^3 steps","Exponential","Breaks RSA encryption; threatens current internet security",[2185,2186,2187,2188,2182,2189],"Quantum simulation","Model quantum systems (molecules, materials)","Exponential in number of particles: 2^(particles)","Polynomial in number of particles","Drug design, battery materials, catalysts",{"id":2191,"type":1648,"variant":1891,"title":2192,"markdown":2193},"callout-56","Grover's speedup is proven optimal","No quantum algorithm can search an unsorted database faster than Grover's √N scaling. This was mathematically proven by Bennett, Bernstein, Brassard, and Vazirani in 1997. It means you cannot hope for a miracle instant search; the square-root gain is the ceiling for this problem class.",{"id":2195,"type":1654,"title":2196,"problem":2197,"steps":2198},"worked-example-57","Grover's search step-by-step for N = 16 items","A classical computer needs up to 16 checks to find one marked item among 16 unsorted entries. How does Grover's algorithm reduce this?",[2199,2200,2201,2202,2203,2204],"Start the quantum system in an equal superposition of all 16 possible states. Each state initially has equal amplitude—like 16 equally likely guesses existing at once.","Apply the **oracle**: a quantum operation that marks the correct answer by flipping the sign of its amplitude. The marked state now points opposite to the others, but measuring now would still give a random result.","Apply **amplitude amplification**: reflect all amplitudes about their average. This mathematical step slightly boosts the marked state's probability and suppresses others. The operation is called the **Grover diffusion operator**.","Repeat the oracle-plus-amplification pair. Each iteration rotates the collective state closer to the marked one. For N = 16, the optimal number of iterations is roughly (π\u002F4) × √16 ≈ 3.14, so about 3 iterations suffice.","Measure the qubits. The probability of obtaining the correct answer is now very high—over 99% after optimal iterations. You found the item in ~3 quantum steps versus ~8 classical steps on average.","The pattern holds as N grows: for one million items, optimal iterations are about 785, versus 500,000 classical checks.",{"id":2206,"type":1648,"variant":1664,"title":2207,"markdown":2208},"callout-58","Quantum computers do not simply 'try everything at once'","A common oversimplification says Grover's algorithm checks all entries simultaneously. This is wrong. Superposition lets the quantum state encode all possibilities, but measurement collapses to one outcome. The speedup comes from **amplitude amplification**—a careful choreography of interference that steers probability toward the right answer. Without the repeated reflection steps, measurement would be no better than random guessing.",{"id":2210,"type":1635,"markdown":2211},"prose-59","Shor's algorithm works very differently and carries heavier consequences. Where Grover speeds up search quadratically, Shor factors integers exponentially. Modern internet security relies on **RSA encryption**, which assumes that factoring large numbers (like 2048-bit products of two primes) is computationally hopeless. A sufficiently large quantum running Shor's algorithm could factor such numbers in hours or days—a task that would take classical supercomputers longer than the age of the universe with current methods. The **mechanism** uses quantum **period-finding**: the algorithm transforms factoring into finding the period of a modular exponentiation function, which a quantum computer extracts efficiently through the **quantum Fourier transform**. Indian banks, government portals, and payment systems using RSA are already planning migration to **post-quantum cryptography** precisely because of this threat.\n\nThe third major arena is **quantum simulation**. This is not one algorithm but a family of approaches. When chemists model a molecule with, say, 50 interacting electrons, the classical representation requires tracking roughly 2^50 quantum states—over one quadrillion numbers. No supercomputer can store this. But a quantum computer with about 50 well-behaved qubits can naturally represent the same system, because qubits are themselves quantum objects. Richard Feynman proposed this in 1982: use a controllable quantum system to simulate another. Indian pharmaceutical researchers and ISRO scientists monitor this area because catalysts for clean hydrogen production and materials for lightweight spacecraft components are fundamentally quantum problems where classical approximation reaches its limits.",{"id":2213,"type":1689,"prompt":2214,"options":2215,"explanation":2224},"prediction-60","A pharmaceutical company must search a chemical library of 10,000 compounds for one that binds to a specific protein. They have a classical supercomputer and a small quantum processor. Which approach wins, and by roughly what factor?",[2216,2218,2220,2222],{"id":1693,"label":2217},"Classical is faster because quantum computers are still too small",{"id":1696,"label":2219},"Quantum with Grover's algorithm needs ~100 steps versus ~5,000 classical—about 50x speedup",{"id":1699,"label":2221},"Quantum with Shor's algorithm factors the protein structure to find the drug",{"id":1702,"label":2223},"Both need exactly 10,000 checks because quantum speedup is a myth","The correct answer is **b**: Grover's algorithm provides roughly √N speedup. For 10,000 items, optimal quantum steps are about (π\u002F4) × 100 ≈ 79, versus 5,000 average classical checks. However, **a** is practically valid today because today's quantum hardware cannot yet run Grover reliably at this scale. The prediction tests understanding of the theoretical mechanism, not current engineering reality. Option c confuses Shor's algorithm (factoring) with search. Option d contradicts proven mathematical results.",{"id":2226,"type":1648,"variant":2227,"title":2228,"markdown":2229},"callout-61","model_limit","Quantum computers do not solve all hard problems","Despite remarkable speedups for specific tasks, no quantum algorithm is known to solve **NP-complete problems** efficiently. These include the traveling salesperson problem, general SAT solving, and thousands of optimization challenges. Many people assume quantum computers will soon solve everything; this is false. The **quantum advantage** is narrow, and for many important problems, quantum offers no proven speedup at all.",{"id":2231,"type":1672,"tone":2232,"items":2233},"spec-62","amber",[2234,2238,2242,2246],{"label":2235,"big":2236,"value":2237},"Grover speedup","√N","Search unsorted database; proven optimal for this problem class",{"label":2239,"big":2240,"value":2241},"Shor exponent","~n^3","Factor n-digit integer versus sub-exponential classical best",{"label":2243,"big":2244,"value":2245},"Simulation span","2^n → poly(n)","Exponential to polynomial for quantum system modeling",{"label":2247,"big":2248,"value":2249},"NP-complete","None known","No efficient quantum algorithm known for this broad class",{"id":2251,"type":1707,"title":2252,"points":2253},"summary-63","Where quantum wins—and where it does not",[2254,2255,2256,2257,2258],"Grover's algorithm searches N unsorted items in ~√N steps, a quadratic speedup proven optimal for unstructured search.","Shor's algorithm factors integers in polynomial time, an exponential speedup that threatens RSA encryption and drives post-quantum cryptography research.","Quantum simulation naturally models molecules and materials, turning exponentially large classical problems into tractable quantum ones.","Quantum advantage is problem-specific; no quantum speedup is known for NP-complete problems.","Indian applications—secure banking, ISRO materials research, pharmaceutical modeling—are all shaped by these narrow but powerful capabilities.",{"id":2260,"type":1639,"title":2261,"eyebrow":2262,"navLabel":2263},"chapter-64","The Hardware Battle: Decoherence, Errors, and Scaling","Chapter 07","Building the machine",{"id":2265,"type":1635,"markdown":2266},"prose-65","Imagine holding a glass of hot chai perfectly still. Even so, the heat slowly leaks into the air, the steam rises, and eventually your chai turns cold. A qubit faces a similar tragedy. It stores delicate quantum information—superposition and entanglement—but the surrounding world constantly tugs at it. Warm air, stray magnetic fields, even vibrations from a passing truck can nudge a qubit out of its fragile state. This leaking away of quantum properties is called **decoherence**. It is the single biggest enemy of quantum engineers, and fighting it drives almost every design choice in a quantum computer.\n\nUnlike ordinary bits etched in silicon that happily sit at room temperature, most qubits must be shielded, cooled, and isolated to near-extreme conditions. The reason is simple: decoherence destroys the very features that make quantum computing powerful. When decoherence strikes, superposition collapses to a definite 0 or 1, and entanglement evaporates. The computation is ruined. Understanding decoherence, error rates, and the engineering path forward is essential because it tells us why today's quantum computers are still experimental, and why building a truly useful one remains one of the hardest challenges in modern science.",{"id":2268,"type":1672,"tone":1673,"items":2269},"spec-66",[2270,2274,2278,2282,2286],{"label":2271,"big":2272,"value":2273},"Superconducting qubits","~15 mK","Operating temperature, about 180 times colder than outer space, in dilution refrigerators made by companies like Bluefors and Janis",{"label":2275,"big":2276,"value":2277},"Ion trap qubits","~10^-11 Torr","Ultra-high vacuum pressure, roughly 100 trillion times emptier than Earth's atmosphere at sea level",{"label":2279,"big":2280,"value":2281},"Single-qubit gate error","0.1%","Best reported fidelity; roughly 1 wrong operation per 1,000 gates in leading superconducting systems",{"label":2283,"big":2284,"value":2285},"Two-qubit gate error","0.5-1%","Typically 5-10 times worse than single-qubit errors, making multi-qubit circuits especially fragile",{"label":2287,"big":2288,"value":2289},"Physical vs logical","1000:1","Overhead ratio in standard surface-code quantum error correction; thousands of physical qubits needed per reliable logical qubit",{"id":2291,"type":1648,"variant":1664,"title":2292,"markdown":2293},"callout-67","\"More qubits always mean a better quantum computer\"","Headlines celebrate IBM's Condor processor with 1,121 qubits or Google's Sycamore with 70 qubits. But qubit count alone is misleading. A qubit that decoheres in 50 microseconds with 1% gate error is far less useful than one that lasts 500 microseconds with 0.1% error. Engineers use a combined metric called **quantum volume** or **circuit layer operations per second (CLOPS)** to capture speed, connectivity, and fidelity together. A 50-qubit machine with high fidelity can outperform a 1000-qubit machine with poor coherence. Always ask: how long do the qubits live, how accurately can you operate gates, and how many qubits can actually interact?",{"id":2295,"type":2296,"title":2297,"scale":2298,"rungs":2299},"ladder-68","ladder","Temperature extremes for qubit technologies","linear",[2300,2304,2308,2312,2316],{"label":2301,"value":2302,"display":2303},"Room temperature (silicon classical chip)",300,"300 K",{"label":2305,"value":2306,"display":2307},"Deep space background",2.7,"2.7 K",{"label":2309,"value":2310,"display":2311},"Superconducting qubits (Google, IBM)",0.015,"15 mK",{"label":2313,"value":2314,"display":2315},"Dilution refrigerator base temperature",0.005,"5 mK",{"label":2317,"value":2318,"display":2319},"Coldest achieved in lab",1e-7,"100 pK",{"id":2321,"type":1635,"markdown":2322},"prose-69","Decoherence times vary dramatically by technology. Superconducting qubits, used by Google and IBM, typically maintain coherence for 50-150 microseconds. That sounds brief—and it is. A classical computer clock ticks billions of times per second, but a superconducting quantum processor must complete all operations before the quantum state dissolves. **Trapped ion** qubits, pursued by companies like IonQ and Honeywell, can last for seconds or even minutes because individual atoms suspended in electromagnetic traps are naturally well-isolated. However, trapped ion systems operate more slowly because moving information between ions takes milliseconds. **Photonic** qubits using light avoid cold temperatures entirely but struggle with probabilistic gate operations and photon loss. Each approach trades off coherence time, operation speed, and scalability differently.\n\nThe error problem compounds brutally. Suppose a quantum algorithm uses 1,000 two-qubit gates, and each gate has a 1% error probability. The chance of the entire circuit running perfectly is (0.99)^1000, which is essentially zero—about 4 × 10^-5. Even at 0.1% error, a 10,000-gate circuit fails most of the time. This is why **quantum error correction** is not optional for serious computation; it is mandatory. The leading scheme, the **surface code**, can suppress errors exponentially if physical error rates fall below a threshold near 1%. But the cost is staggering: protecting one logical qubit might require 1,000 physical qubits in optimistic estimates, or tens of thousands in conservative ones. Today's largest machines barely have enough qubits to create even one logical qubit, let alone the hundreds needed for useful applications.",{"id":2324,"type":1654,"title":2325,"problem":2326,"steps":2327},"worked-example-70","Calculating when errors overwhelm a circuit","A quantum algorithm needs 500 two-qubit gates to run. The two-qubit gate error rate is 0.5%. What is the approximate probability that the entire circuit completes without any gate error?",[2328,2329,2330,2331,2332],"First, convert the error rate to success probability per gate: 1 - 0.005 = 0.995, or 99.5% success per gate.","Since gate errors are independent in this simplified model, multiply the success probability across all 500 gates: P(success) = (0.995)^500.","Calculate using logarithms or approximation: ln(0.995) ≈ -0.0050125, so 500 × (-0.0050125) = -2.506.","Exponentiate: e^(-2.506) ≈ 0.0816, or about 8.2%.","This means even with relatively good 0.5% gates, a modest 500-gate circuit fails approximately 92% of the time. Error correction or repeated runs would be essential for reliable results.",{"id":2334,"type":1648,"variant":2227,"title":2335,"markdown":2336},"callout-71","Our simplified error model","We assumed each gate fails independently with fixed probability, like unfair coin tosses. Real quantum errors are more complex: correlations exist between qubits, errors may drift over time, and some errors are systematic (always pushing the same direction) rather than random. Physicists model this with **Kraus operators** and **Lindblad master equations**, which are beyond our scope but matter enormously for designing actual error correction. Our calculation gives intuition, not engineering precision.",{"id":2338,"type":1810,"itemId":2339,"prompt":2340,"check":2341,"hints":2353,"feedback":2358},"practice-72","quantum-computing.p003","IBM improves its two-qubit gate error from 0.5% to 0.3%. A quantum algorithm needs 800 two-qubit gates. By what factor does the success probability improve? Choose the closest estimate.",{"kind":2342,"options":2343,"correct":2352},"choice",[2344,2346,2348,2350],{"id":1693,"label":2345},"About 1.5x more likely to succeed",{"id":1696,"label":2347},"About 3x more likely to succeed",{"id":1699,"label":2349},"About 5x more likely to succeed",{"id":1702,"label":2351},"About 10x more likely to succeed",[1699],[2354,2355,2356,2357],"Calculate success probability at 0.5% error: (0.995)^800.","Calculate success probability at 0.3% error: (0.997)^800.","Use ln(0.995) ≈ -0.0050125 and ln(0.997) ≈ -0.0030045.","The exponents are -4.01 and -2.40; e^(-4.01) ≈ 0.018 and e^(-2.40) ≈ 0.091. The ratio is about 5.",{"correct":2359,"incorrect":2360},"Correct! The success probability improves from roughly 1.8% to about 9.1%, which is about a 5-fold improvement. Small error rate reductions have large effects because errors compound exponentially with gate count.","The ratio is approximately 5. At 0.5% error, success is roughly e^(-4) ≈ 1.8%. At 0.3% error, success is roughly e^(-2.4) ≈ 9.1%. The roughly 5x improvement shows why engineers chase every tenth of a percent in fidelity.",{"id":2362,"type":1639,"title":2363,"eyebrow":2364,"navLabel":2365},"chapter-73","Check Yourself, and What Comes Next","Chapter 08","Quiz and path",{"id":2367,"type":1635,"markdown":2368},"prose-74","You have travelled from the everyday puzzle of searching a phone book, through the strange world where a qubit can be both 0 and 1 until measured, to the数学al machinery that makes a quantum computer tick. You have seen that entanglement is not merely \"correlation\" but a resource without classical counterpart, that quantum gates must be reversible, and that algorithms like Grover's and Shor's exploit interference to win—not magic, but choreographed cancellation. You have also met the enemy: decoherence, the loss of quantum information to the environment.\n\nBefore you step further, pause and test whether these ideas have settled into genuine understanding. The quiz below mixes calculation, concept-checking, and the kind of subtle misconception that even graduate students wrestle with. Treat it as a map: wrong answers show you exactly where the terrain is still fuzzy.",{"id":2370,"type":2371,"title":2372,"questions":2373},"quiz-75","quiz","The Quantum Check-Up",[2374,2383,2392,2405,2418,2431],{"itemId":2375,"prompt":2376,"options":2377,"correct":1699,"why":2382},"quantum-computing.q004","A single qubit in state |0⟩ passes through a Hadamard gate. What is the probability of measuring 1?",[2378,2379,2380,2381],{"id":1693,"label":2114},{"id":1696,"label":2128},{"id":1699,"label":2121},{"id":1702,"label":2113},"The Hadamard gate transforms |0⟩ into (|0⟩ + |1⟩)\u002F√2. The amplitudes are equal in magnitude, so |probability|² gives 0.5 for each outcome. This is the first act of creating superposition.",{"itemId":2384,"prompt":2385,"options":2386,"correct":1699,"why":2391},"quantum-computing.q005","Two qubits start in state |10⟩. Apply Hadamard to the first qubit, then CNOT with first qubit as control and second as target. What is the probability of measuring |11⟩?",[2387,2388,2389,2390],{"id":1693,"label":2114},{"id":1696,"label":2128},{"id":1699,"label":2121},{"id":1702,"label":2113},"After H, the first qubit becomes (|0⟩+|1⟩)\u002F√2 while the second stays |0⟩: state is (|00⟩+|10⟩)\u002F√2. CNOT flips the target when control is |1⟩, giving (|00⟩+|11⟩)\u002F√2. The amplitude of |11⟩ is 1\u002F√2, so probability is 1\u002F2. Notice the entangled Bell pair that emerges.",{"itemId":2393,"prompt":2394,"options":2395,"correct":1696,"why":2404},"quantum-computing.q006","Which statement about entanglement is FALSE?",[2396,2398,2400,2402],{"id":1693,"label":2397},"Measuring one entangled qubit instantly fixes the state of its partner, no matter the distance.",{"id":1696,"label":2399},"Entanglement allows faster-than-light transmission of useful information.",{"id":1699,"label":2401},"Entangled qubits cannot each be described by an individual pure state; only the joint state works.",{"id":1702,"label":2403},"The EPR paradox highlighted that entanglement seems to require 'spooky action at a distance.'","The no-communication theorem says entangled correlations are revealed only when classical results are compared later. You cannot force your partner's outcome and thus cannot signal. The correlation is real, but causality remains intact.",{"itemId":2406,"prompt":2407,"options":2408,"correct":1696,"why":2417},"quantum-computing.q007","Grover's algorithm searches an unsorted database of N items. How many quantum queries are needed to find the marked item with high probability, versus O(N) classically?",[2409,2411,2413,2415],{"id":1693,"label":2410},"O(N²): quantum is quadratically worse",{"id":1696,"label":2412},"O(√N): quadratic speedup",{"id":1699,"label":2414},"O(log N): exponential speedup",{"id":1702,"label":2416},"O(1): instant answer","Grover gives a quadratic speedup: about (π\u002F4)√N iterations. The magic is amplitude amplification—boosting the right answer's probability through interference, not examining all items in parallel. Exponential speedup comes elsewhere (Shor, simulation), not here.",{"itemId":2419,"prompt":2420,"options":2421,"correct":1696,"why":2430},"quantum-computing.q008","A quantum logic gate must be reversible and unitary. What does 'unitary' mean in terms of information?",[2422,2424,2426,2428],{"id":1693,"label":2423},"It destroys information to save energy",{"id":1696,"label":2425},"It preserves total probability: the sum of |amplitude|² remains 1",{"id":1699,"label":2427},"It allows cloning of any unknown quantum state",{"id":1702,"label":2429},"It converts classical bits into qubits permanently","Unitary means U†U = I: the time-reversed operation exists, and probabilities sum to 1. This is why quantum evolution is deterministic even though measurement is probabilistic. The no-cloning theorem, not unitarity, forbids copying arbitrary states.",{"itemId":2432,"prompt":2433,"options":2434,"correct":1696,"why":2443},"quantum-computing.q009","Which hardware challenge is MOST directly fought by quantum error correction?",[2435,2437,2439,2441],{"id":1693,"label":2436},"The inability to fabricate qubits at room temperature",{"id":1696,"label":2438},"Decoherence and environmental noise corrupting fragile superpositions",{"id":1699,"label":2440},"Classical computers becoming too cheap",{"id":1702,"label":2442},"The finite speed of light limiting signal travel","Decoherence is the leakage of quantum information into the environment. Error correction encodes one logical qubit into many physical qubits so that syndrome measurements catch and fix damage without directly collapsing the stored quantum information. Google Quantum AI and IBM both identify this as the central scaling hurdle.",{"id":2445,"type":1648,"variant":1664,"title":2446,"markdown":2447},"callout-76","The 'Massive Parallelism' Myth","A dangerous shorthand says quantum computers \"try all answers at once.\" This is wrong in a critical way. A superposition does contain many states simultaneously, but a naive measurement would yield just one random result. The power comes from interference: algorithms choreograph amplitudes so that wrong answers cancel (destructive interference) and right answers reinforce (constructive interference). Without interference, you have only a noisy lottery, not a computation. Interference and entanglement together are the non-classical resources; superposition alone is insufficient.",{"id":2449,"type":1654,"title":2450,"problem":2451,"steps":2452},"worked-example-77","Tracing a Common Error: Is |00⟩ + |11⟩ the Same as |01⟩ + |10⟩?","A student argues: \"Both states have two qubits in superposition with equal amplitudes, so they behave identically under measurement.\" Show why this fails, using the CNOT gate.",[2453,2454,2455,2456,2457],"Write state A: (|00⟩ + |11⟩)\u002F√2 and state B: (|01⟩ + |10⟩)\u002F√2. In both, each qubit individually has 50% chance of 0 or 1.","Check single-qubit statistics: for state A, measure qubit 1. You get 0 or 1 each with probability 1\u002F2. Same for state B. The local picture is identical; entanglement is not visible locally.","Apply CNOT(control=1, target=2) to state A. The |00⟩ term stays |00⟩. The |11⟩ term becomes |10⟩ (flip second bit). Result: (|00⟩ + |10⟩)\u002F√2 = |0⟩⊗(|0⟩+|1⟩)\u002F√2. The qubits are now unentangled; state factors.","Apply the same CNOT to state B. The |01⟩ term becomes |01⟩ (control is 0, no flip). The |10⟩ term becomes |11⟩. Result: (|01⟩ + |11⟩)\u002F√2 = |1⟩⊗(|0⟩+|1⟩)\u002F√2. Again unentangled, but note the control qubit ended as |0⟩ in case A and |1⟩ in case B.","The lesson: global phases and amplitudes matter. States with identical local statistics can evolve differently under the same gates. Entanglement structure, not merely local probabilities, determines computational behaviour.",{"id":2459,"type":1635,"markdown":2460},"prose-78","If you found the calculation above slippery, you are feeling the gap between intuitive words and mathematical precision. The next depth level—\"foundations\"—closes this gap by introducing Dirac notation as a native language, tensor products for multi-qubit states, and density matrices for mixed states (when you no longer know the exact quantum state). Alternatively, an \"algorithms\" depth derives Grover's reflection operators and Shor's period-finding in full; a \"hardware\" depth dives into superconducting transmons, ion traps, and the surface code that Google and IBM are racing to demonstrate. Each path assumes you now hold the mental models built in these eight chapters: superposition as amplitude, entanglement as non-factorability, gates as unitary acts, and noise as the ever-present adversary.",{"id":2462,"type":1707,"title":2463,"points":2464},"summary-79","What to Carry Forward",[2465,2466,2467,2468,2469,2470,2471,2472,2473,2474],"A qubit's state is a superposition α|0⟩ + β|1⟩ with complex amplitudes; |α|² and |β|² are the measurement probabilities.","Superposition is not mere 'both at once'—it is a resource only when combined with interference and entanglement.","Entanglement means the joint state cannot be written as a product of individual states; local measurements are correlated but cannot signal faster than light.","Quantum gates are reversible, unitary matrices; they preserve total probability and have classical analogues only for gates like NOT and CNOT.","Two-qubit states live in a 4-dimensional complex vector space; the dimension grows exponentially with qubit count, but accessible information does not.","Grover's search achieves O(√N) query complexity via amplitude amplification, not exponential speedup.","Shor's algorithm factors integers in polynomial time by finding periods in a quantum superposition, threatening RSA encryption.","Decoherence and operational errors are the central obstacles; quantum error correction encodes logical qubits across many physical qubits.","Current hardware (superconducting circuits, ion traps, photonics) operates at millikelvin temperatures or vacuum isolation; scaling to thousands of logical qubits remains unsolved.","Quantum computers will not replace classical computers; they accelerate specific problems in simulation, optimisation, and cryptanalysis.",{"id":2476,"type":1913,"title":2477,"terms":2478},"glossary-80","Key Terms of the Lesson",[2479,2482,2486,2490,2494,2497,2501,2505,2509,2513,2517,2520,2523,2527,2530],{"term":1782,"meaning":2480,"example":2481},"The basic unit of quantum information, existing in a superposition of |0⟩ and |1⟩ until measured.","An electron's spin-up and spin-down states can encode a qubit.",{"term":2483,"meaning":2484,"example":2485},"Superposition","A quantum state that is a linear combination of basis states, with complex amplitudes.","(|0⟩ + |1⟩)\u002F√2 is an equal superposition of 0 and 1.",{"term":2487,"meaning":2488,"example":2489},"Entanglement","A correlation between qubits that cannot be described by any local hidden variable theory; the joint state is not separable.","The Bell state (|00⟩ + |11⟩)\u002F√2.",{"term":2491,"meaning":2492,"example":2493},"Amplitude","A complex number coefficient in a quantum superposition; its squared magnitude gives a probability.","In 0.6|0⟩ + 0.8i|1⟩, the probability of |1⟩ is |0.8i|² = 0.64.",{"term":34,"meaning":2495,"example":2496},"An irreversible operation that collapses a superposition to a basis state with probability given by amplitude squared.","Measuring (|0⟩ + |1⟩)\u002F√2 yields 0 or 1 each with 50% chance.",{"term":2498,"meaning":2499,"example":2500},"Quantum gate","A unitary operation on one or more qubits that evolves the state reversibly.","The Hadamard gate H creates equal superposition from |0⟩.",{"term":2502,"meaning":2503,"example":2504},"CNOT","Controlled-NOT, a two-qubit gate that flips the target qubit if and only if the control qubit is |1⟩.","CNOT|11⟩ = |10⟩.",{"term":2506,"meaning":2507,"example":2508},"Unitary matrix","A square matrix U where U†U = I; preserves inner products and total probability.","The Hadamard matrix (1\u002F√2)[[1,1],[1,-1]].",{"term":2510,"meaning":2511,"example":2512},"Interference","The addition of quantum amplitudes, which can constructively reinforce or destructively cancel pathways.","In Grover's algorithm, wrong answers' amplitudes cancel over iterations.",{"term":2514,"meaning":2515,"example":2516},"Decoherence","Loss of quantum coherence due to interaction with the environment, turning superpositions into classical mixtures.","A qubit in a thermal bath losing its phase information after microseconds.",{"term":1917,"meaning":2518,"example":2519},"One of four maximally entangled two-qubit states; the simplest entangled resource.","|Φ+⟩ = (|00⟩ + |11⟩)\u002F√2.",{"term":1924,"meaning":2521,"example":2522},"It is impossible to create an independent and identical copy of an arbitrary unknown quantum state.","Prevents simple error correction strategies from classical computing.",{"term":2524,"meaning":2525,"example":2526},"Grover's algorithm","A quantum search algorithm finding a marked item in an unsorted database with O(√N) queries.","Searching one name in an unsorted phone book of one million entries.",{"term":2178,"meaning":2528,"example":2529},"A quantum algorithm for integer factorisation in polynomial time, exploiting quantum Fourier transform period-finding.","Factoring a 2048-bit RSA modulus efficiently.",{"term":2531,"meaning":2532,"example":2533},"Quantum error correction","Encoding logical qubits across multiple physical qubits to detect and correct errors without direct measurement destroying coherence.","The surface code using a 2D lattice of qubits.",{"id":2535,"type":697,"prompt":2536},"reflection-81","Look back at your quiz answers. Which question surprised you most? Write one sentence describing why the correct answer differs from your intuition, and identify whether the gap is in calculation, concept, or the model of how quantum systems behave.",{"id":2538,"type":2539,"sourceIds":2540},"sources-82","sources",[2541,2542,2543,2544,2545,2546],"quantum-network-wikipedia-en-wikipedia","quantum-computing-wikipedia-en-wikipedia","what-is-quantum-computing-google-quantumai","quantum-computing-explained-in-simple-spinq","what-is-quantum-computing-ibm-ibm","quantum-computing-explained-nist-nist",[2541,2542,2543,2544,2545,2546],"needs_review",{"generatedBy":2550,"notes":2551},"claude-code","generated from work item wi-03437ed2 (8 chapters)","52fa84ea53aa1392ef3528717035b080e21d2836d2128dabee48698d8dc04e31",{},{"state":6,"reviewer":2555,"selfReview":1358,"reviewedAt":2556,"method":806},"curator","2026-09-23T08:21:55.761776+00:00","generation-b60fa5cc-02e7-4ab0-9081-c36156ee40fe",[2559,2567,2571,2576,2581,2586],{"id":2541,"title":2560,"publisher":2561,"url":2562,"kind":2563,"accessed":2564,"usage":2565,"verification":2566},"Quantum network - Wikipedia","en.wikipedia.org","https:\u002F\u002Fen.wikipedia.org\u002Fwiki\u002FQuantum_network","reference","2026-09-23","Provides an overview of quantum networks covering their role in quantum computing and communication, plus components like end nodes, physical communication lines, quantum repeaters, and applications including secure communications and quantum internet.","machine_checked",{"id":2542,"title":2568,"publisher":2561,"url":2569,"kind":2563,"accessed":2564,"usage":2570,"verification":2566},"Quantum computing - Wikipedia","https:\u002F\u002Fen.wikipedia.org\u002Fwiki\u002FQuantum_computing","Offers comprehensive coverage of quantum computing history, quantum information processing, algorithms, engineering challenges like decoherence, physical realizations, and theoretical foundations of computability and complexity.",{"id":2543,"title":2572,"publisher":2573,"url":2574,"kind":2563,"accessed":2564,"usage":2575,"verification":2566},"What is quantum computing? | Google Quantum AI","quantumai.google","https:\u002F\u002Fquantumai.google\u002Fwhatisqc","Explains superposition as qubits being in complex combinations of 0 and 1, enabling exploration of exponentially large solution spaces, and describes the NISQ era of current quantum processors.",{"id":2544,"title":2577,"publisher":2578,"url":2579,"kind":2563,"accessed":2564,"usage":2580,"verification":2566},"Quantum Computing Explained in Simple Terms: A Complete Beginner's Guide (2026) | SpinQ","spinq.com","https:\u002F\u002Fwww.spinq.com\u002Fen\u002Fnews-detail\u002Fquantum-computing-explained-in-simple-terms-a-complete-beginners-guide-2026","Introduces qubits as quantum bits that can exist in multiple states simultaneously using superposition, and compares classical bits to qubits with simple analogies.",{"id":2545,"title":2582,"publisher":2583,"url":2584,"kind":2563,"accessed":2564,"usage":2585,"verification":2566},"What Is Quantum Computing? | IBM","ibm.com","https:\u002F\u002Fwww.ibm.com\u002Fthink\u002Ftopics\u002Fquantum-computing","Defines quantum computing as a field harnessing quantum mechanics to solve problems beyond classical computers, covering quantum hardware, algorithms, and applications in chemistry and material science.",{"id":2546,"title":2587,"publisher":2588,"url":2589,"kind":645,"accessed":2564,"usage":2590,"verification":2566},"Quantum Computing Explained | NIST","nist.gov","https:\u002F\u002Fwww.nist.gov\u002Fquantum-information-science\u002Fquantum-computing-explained","Explains that quantum computers use qubits instead of classical bits, and that qubits can exist in superpositions of multiple states."]